A new mathematical model for single machine batch scheduling problem for minimizing maximum lateness with deteriorating jobs

• Published in: International journal of industrial engineering computations Vol. 3; no. 2; pp. 253 - 264
• Main Authors: Haddad, Hamidreza, Ghanbari, Payam, Zeraatkar Moghaddam, Ahmad
• Format: Journal Article
• Language: English
• Published: Growing Science 01-01-2012
• Subjects: Batch scheduling; Deterioration; Simulated annealing; Single machine
• DOI: 10.5267/j.ijiec.2011.07.003
• EISSN: 1923-2934
• ISSN: 1923-2926

This paper presents a mathematical model for the problem of minimizing the maximum lateness on a single machine when the deteriorated jobs are delivered to each customer in various size batches. In reality, this issue may happen within a supply chain in which delivering goods to customers entails cost. Under such situation, keeping completed jobs to deliver in batches may result in reducing delivery costs. In literature review of batch scheduling, minimizing the maximum lateness is known as NP-Hard problem; therefore the present issue aiming at minimizing the costs of delivering, in addition to the aforementioned objective function, remains an NP-Hard problem. In order to solve the proposed model, a Simulation annealing meta-heuristic is used, where the parameters are calibrated by Taguchi approach and the results are compared to the global optimal values generated by Lingo 10 software. Furthermore, in order to check the efficiency of proposed method to solve larger scales of problem, a lower bound is generated. The results are also analyzed based on the effective factors of the problem. Computational study validates the efficiency and the accuracy of the presented model.