INCREMENTAL METHOD BY CONSTANT TIME FOR SOLVING JOB SHOP SCHEDULING PROBLEMS
Job shop scheduling in manufacturing systems is planned by a dispatching rule. In general, incremental time in a simulation method for job shop scheduling problems is not constant but variable. In an incremental method by constant time, every occurring event is processed according to clock time changed by unity. This paper presents an incremental method by constant time for solving job shop scheduling problems. Also the proposed method is applicable to the modified job shop scheduling problem in which preceding relations are altered, i.e., there are a few preceding processing operations although only one preceding processing operation generally exists.
job shop scheduling incremental method several precedence relations
Akimine Nishikori
Faculty of Management and Information Systems, Prefectural University of Hiroshima Hiroshima 734-8558,Japan
国际会议
The Tneth International Conference on Industrial Management(第十届工业管理国际会议 ICIM 2010)
北京
英文
38-42
2010-09-16（万方平台首次上网日期，不代表论文的发表时间）