This paper proposes an efficient heuristic to minimise the total weighted tardiness of a set of tasks with known processing times, due dates, weights and family types for parallel machines. A three-phase heuristic is presented to minimise total weighted tardiness. In the first phase, jobs are listed by the earliest due date and then divided into small job-sets according to a decision parameter. In the second phase, jobs are grouped by the due date within applicable families using apparent tardiness cost with set-up (ATCS), and the sequence of jobs within families is improved through the use of the tabu search method. In the third phase, jobs are allocated to machines using a threshold value and a look-ahead parameter.
The comprehensive simulation results show that the proposed heuristic performs better than the ATCS and rolling horizon procedure at a significantly reduced total weighted tardiness.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Eom, DH., Shin, HJ., Kwun, IH. et al. Scheduling Jobs on Parallel Machines with Sequence-Dependent Family Set-up Times. Int J Adv Manuf Technol 19, 926–932 (2002). https://doi.org/10.1007/s001700200105
Issue Date:
DOI: https://doi.org/10.1007/s001700200105