A due date density-based categorising heuristic for parallel machines scheduling

S. S. Kim, H. J. Shin, D. H. Eom, C. O. Kim

Research output: Contribution to journalArticlepeer-review

12 Citations (Scopus)


The effective management of shop floor resources is an important factor in achieving the goals of a manufacturing company. The need for effective scheduling is particularly strong in complex manufacturing environments. This paper presents an efficient due date density-based categorising heuristic to minimise the total weighted tardiness (TWT) of a set of tasks with known processing times, due dates, weights and sequence-dependent setup times for parallel machines scheduling. The proposed heuristic is composed of four phases. In the first phase, jobs are listed by the earliest due date (EDD). The second phase computes the due date gaps between listed jobs and categorises the jobs based on the due date density. In the third phase, the sequence of jobs is improved by a tabu search (TS) method. The fourth phase allocates each job to machines. The comprehensive simulation results show that the proposed heuristic performs better than other existing heuristics at a significantly reduced total weighted tardiness.

Original languageEnglish
Pages (from-to)753-760
Number of pages8
JournalInternational Journal of Advanced Manufacturing Technology
Issue number9-10
Publication statusPublished - 2003

All Science Journal Classification (ASJC) codes

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


Dive into the research topics of 'A due date density-based categorising heuristic for parallel machines scheduling'. Together they form a unique fingerprint.

Cite this