A simulated annealing for the single machine batch scheduling problem with the objective of minimizing total tardiness and job values in Makespan with deteriorating jobs

This paper presents a mathematical model for the problem of minimizing the total tardiness and job values in makespan on a single machine when the deteriorated jobs are delivered to each customer in various size batches. Under such circumstances, keeping completed jobs to be delivered in batches may result in reducing delivery costs. In addition, it may cause the job process to accelerate.In order to solve the proposed model, a Simulation annealing meta-heuristic that is calibrated by a Taguchi approach is used and its results are compared with the global optimal values that are generated by Lingo 10 software. Based on the effective factors of the problem, a number of sensitivity analyses are also implemented.In order to examine the efficiency of proposed SA for larger scales, a lower bound is also generated and compared with the results of SA. Computational study validates the efficiency and accuracy of the presented model.

Keywords:

Batch scheduling , single machine , deterioration , job values in makespan