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

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

*此作品的通信作者

研究成果: 雜誌貢獻期刊論文同行評審

73 引文 斯高帕斯(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.

原文英語
頁(從 - 到)3245-3262
頁數18
期刊International Journal of Production Research
45
發行號14
DOIs
出版狀態已發佈 - 2007 7月
對外發佈

ASJC Scopus subject areas

  • 策略與管理
  • 管理科學與經營研究
  • 工業與製造工程

指紋

深入研究「Using dispatching rules for job shop scheduling with due date-based objectives」主題。共同形成了獨特的指紋。

引用此