This research studied the problem of minimizing the total tardiness and maximizing the job values in makespan on a single machine when the deteriorated jobs are delivered to each customer in various size batches and there are some priorities between the jobs. 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 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 Simulated Annealying (SA) for larger scales, a lower bound is also generated and is compared with the results of SA. Computational study validates the efficiency and accuracy of the presented model.
Mehdi Karimi- Nasab, Hamidreza Haddad and Payam Ghanbari, 2012. A Simulated Annealing for the Single Machine Batch Scheduling with Deterioration and Precedence Constraints. Asian Journal of Industrial Engineering, 4: 1-16.