Using dispatching rules for job shop scheduling with due date-based objectives

T. C. Chiang*, L. C. Fu

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

73 Citations (Scopus)


This paper addresses the job shop-scheduling problem with due date-based objectives including the tardy rate, mean tardiness and maximum tardiness. The focused approach is the dispatching rules. Eighteen dispatching rules are selected from the literature, and their features and design concepts are discussed. Then a dispatching rule is proposed with the goal of achieving a good and balanced performance when more than one objective is concerned at the same time. First, three good design principles are recognized from the existing rules. Second, it introduces a due date extension procedure to solve a problem of negative allowance time. Third, a job candidate reduction mechanism is developed to make the rule computationally efficient. Lastly, a comprehensive simulation study is conducted with the 18 existing rules as the benchmarks. The experimental results verify the superiority of the proposed rule, especially on the tardy rate and mean tardiness.

Original languageEnglish
Pages (from-to)3245-3262
Number of pages18
JournalInternational Journal of Production Research
Issue number14
Publication statusPublished - 2007 Jul
Externally publishedYes


  • Dispatching rules
  • Due dates
  • Jop shop
  • Scheduling

ASJC Scopus subject areas

  • Strategy and Management
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering


Dive into the research topics of 'Using dispatching rules for job shop scheduling with due date-based objectives'. Together they form a unique fingerprint.

Cite this