A SCHEDULING METHOD FOR HYBRID FLOWSHOPSCHEDULING PROBLEM: PROPOSAL OF THE CHAIN ASSIGNMENT OF JOBS BY EARLIEST STARTING TIME

摘要：

This paper targets the Hybrid Flow Shop scheduling problem, which consists of series of production stages, each of which has multiple machines operating in parallel. This problem is difficult to be solved because of its problem size and structure. An assignment rule ‘Chain Assignment of Jobs by Earliest Starting Time is proposed to downsize the problem without lost of the optimality. In the computational experiments, the proposed method shows its optimality by being compared with the Johnsons rule, and other previous methods.

关键词： scheduling simulatedannealing.

作者: Shunichi.OMORI.Author Kazuho.YOSHIMOTO

作者单位: Department of Industrial and Management Systems Engineering, Waseda University, Room No.51-15-05 3-4 Department of Industrial and Management Systems Engineering, Waseda University,Room No.51-15-05 3-4-

会议类型: 国际会议

会议名称: 第二十届国际生产研究大会

会议地点: 上海

会议语种:英文

页码: 1-6

在线出版日期: 2009-08-02（万方平台首次上网日期，不代表论文的发表时间）