An iterative refining mechanism for general job shop scheduling problems

Tsung Che Chiang*, Li Chen Fu

*此作品的通信作者

研究成果: 書貢獻/報告類型會議論文篇章

摘要

This paper addresses the general job shop scheduling problem with the objective as how to increase the meet-due-date rate. An iterative schedule refining mechanism is proposed, which iteratively adjusts the estimation of the remaining processing times of jobs in a dynamic and stage-specific manner. The refining mechanism is applied to a recently proposed sequencing heuristic and the integrated approach shows satisfactory performance through a comprehensive simulation study. Besides, we also show that the proposed refining mechanism can bring much improvement to several conventional rules.

原文英語
主出版物標題Proceedings of the 2005 IEEE Conference on Automation Science and Engineering, IEEE-CASE 2005
頁面203-208
頁數6
DOIs
出版狀態已發佈 - 2005 十二月 1
事件2005 IEEE Conference on Automation Science and Engineering, IEEE-CASE 2005 - Edmonton, 加拿大
持續時間: 2005 八月 12005 八月 2

出版系列

名字Proceedings of the 2005 IEEE Conference on Automation Science and Engineering, IEEE-CASE 2005
2005

其他

其他2005 IEEE Conference on Automation Science and Engineering, IEEE-CASE 2005
國家/地區加拿大
城市Edmonton
期間2005/08/012005/08/02

ASJC Scopus subject areas

  • 工程 (全部)

指紋

深入研究「An iterative refining mechanism for general job shop scheduling problems」主題。共同形成了獨特的指紋。

引用此