Minimizing Total Weighted Tardiness on Parallel Batch-Processing Machine Scheduling Problems with Varying Machine Capacities
This paper extends the study of Mathirajan et al. (Minimizing total weighted tardiness on a batch-processing machine with non-agreeable release times and due dates. Int. J. Adv. Manuf. Technol., 2010, doi: 10.1007/s00170-009-2342-y) to parallel batch-processing machine problems because these have not been examined to date. For the problem concerning compatible product families, job release times, non-identical job sizes, and varying machine capacities, we propose a mixed integer programming (MIP) model, and a number of simple dispatch-based heuristic and simulated annealing (SA) algorithms. Computational results revealed that the proposed SA is capable of obtaining similar solutions acquired by MIP within a short time. The SA algorithms outperform other heuristic algorithms with respect to solution quality.
F. D. Chou and H. M. Wang, "Minimizing Total Weighted Tardiness on Parallel Batch-Processing Machine Scheduling Problems with Varying Machine Capacities", Applied Mechanics and Materials, Vols. 110-116, pp. 3906-3913, 2012