Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times

Tsung Che Chiang, Li Chen Fu*

*此作品的通信作者

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

27 引文 斯高帕斯(Scopus)

摘要

This paper addresses the job shop scheduling problem to minimize the number of tardy jobs, considering the sequence dependent setup time. This problem is taken as a sequencing problem, and a family of approaches with different levels of intricacy is proposed. The simplest form is a critical ratio-based dispatching rule, which leads to satisfactory solutions by taking into account the group information rather than only the individual information of jobs. Then, an enhanced approach consisting of an iterative schedule refining mechanism will be given. Its feature is to iteratively adjust the estimation of the remaining processing times of jobs in a dynamic and operation-specific manner. Finally, a genetic algorithm which takes the dispatching rule and the refining mechanism as the core is proposed. The performance of these approaches is carefully examined by a comprehensive experimental study.

原文英語
頁(從 - 到)78-92
頁數15
期刊European Journal of Operational Research
196
發行號1
DOIs
出版狀態已發佈 - 2009 七月 1

ASJC Scopus subject areas

  • 電腦科學(全部)
  • 建模與模擬
  • 管理科學與經營研究
  • 資訊系統與管理

指紋

深入研究「Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times」主題。共同形成了獨特的指紋。

引用此