Minimising the total weighted tardiness for non-identical parallel batch processing machines with job release times and non-identical job sizes

2013 ◽  
Vol 7 (5) ◽  
pp. 529
Author(s):  
Fuh Der Chou
Keyword(s):  
Batch Processing ◽  
Total Weighted Tardiness ◽  
Batch Processing Machines ◽  
Weighted Tardiness ◽  
Release Times

Minimizing Total Weighted Tardiness on Parallel Batch-Processing Machine Scheduling Problems with Varying Machine Capacities

2011 ◽  
Vol 110-116 ◽  
pp. 3906-3913 ◽  
Author(s):  
Fuh Der Chou ◽  
Hui Mei Wang
Keyword(s):  
Heuristic Algorithms ◽  
Batch Processing ◽  
Total Weighted Tardiness ◽  
Mixed Integer ◽  
Due Dates ◽  
Weighted Tardiness ◽  
Processing Machine ◽  
Release Times ◽  
Mip Model ◽  
Batch Processing Machine

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.

Sign in / Sign up

Export Citation Format

Share Document