Solving the FMS scheduling problem by critical ratio-based heuristics and the genetic algorithm

Tsung Che Chiang*, Li Chen Fu

*此作品的通信作者

研究成果: 雜誌貢獻會議論文同行評審

15 引文 斯高帕斯(Scopus)

摘要

This paper addresses the FMS scheduling problem. The objective concerned here is maximizing the meet-due-date rate. The authors propose two rules for job sequencing and job dispatching, two common subtasks in solving this problem. These two rules are designed based on the critical ratio values of jobs. We also propose a mechanism to obtain better performance than the stand-alone scheduling process via genetic algorithms. With the nature of design of the proposed job sequencing rule, the genetic algorithm is designed not only to improve the schedule quality but also to save computation time. All the proposed rules and idea are carefully examined through several different scenarios.

原文英語
頁(從 - 到)3131-3136
頁數6
期刊Proceedings - IEEE International Conference on Robotics and Automation
2004
發行號3
出版狀態已發佈 - 2004 七月 5
事件Proceedings- 2004 IEEE International Conference on Robotics and Automation - New Orleans, LA, 美国
持續時間: 2004 四月 262004 五月 1

ASJC Scopus subject areas

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

指紋

深入研究「Solving the FMS scheduling problem by critical ratio-based heuristics and the genetic algorithm」主題。共同形成了獨特的指紋。

引用此