Scheduling jobs on parallel machines with sequence-dependent family set-up times

D. H. Eom, H. J. Shin, I. H. Kwun, J. K. Shim, S. S. Kim

Research output: Contribution to journalArticlepeer-review

41 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)926-932
Number of pages7
JournalInternational Journal of Advanced Manufacturing Technology
Issue number12
Publication statusPublished - 2002


  • Heuristics
  • Parallel machines
  • Scheduling
  • Sequence-dependent family set-up times
  • Total weighted tardiness

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Software
  • Mechanical Engineering
  • Computer Science Applications
  • Industrial and Manufacturing Engineering


Dive into the research topics of 'Scheduling jobs on parallel machines with sequence-dependent family set-up times'. Together they form a unique fingerprint.

Cite this