A virtual preemption paradigm for using priority rules to solve job shop scheduling problems

Tsung Che Chiang, Li Chen Fu

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

2 引文 斯高帕斯(Scopus)

摘要

To solve job shop scheduling problems, the priority rule is one of the most popular approach. It has the appeal because of simplicity, efficiency and effectiveness. However, the paradigm conventionally used to apply priority rules has a certain flaw. In this paper, we first point out this flaw and then propose a paradigm to remove it. A rule is also developed to exploit the potential of the new paradigm. The performance of the proposed approach is verified by several simulation experiments. The experimental results are quite satisfactory.

原文英語
主出版物標題Proceedings of the 2005 IEEE International Conference on Robotics and Automation
頁面3703-3708
頁數6
DOIs
出版狀態已發佈 - 2005 十二月 1
事件2005 IEEE International Conference on Robotics and Automation - Barcelona, 西班牙
持續時間: 2005 四月 182005 四月 22

出版系列

名字Proceedings - IEEE International Conference on Robotics and Automation
2005
ISSN(列印)1050-4729

其他

其他2005 IEEE International Conference on Robotics and Automation
國家/地區西班牙
城市Barcelona
期間2005/04/182005/04/22

ASJC Scopus subject areas

  • 軟體
  • 控制與系統工程
  • 人工智慧
  • 電氣與電子工程

指紋

深入研究「A virtual preemption paradigm for using priority rules to solve job shop scheduling problems」主題。共同形成了獨特的指紋。

引用此