Method for Confirming Increasable Bottleneck Device Based on Study of Parallel Operation
Common job-shop scheduling problem is based on that every processing device is single so there is usually certain kind of device which becomes the scheduling bottleneck and affects the processing efficiency of production most. Adding the bottleneck device is a simple method for solving bottleneck problem, but the key problem includes two sides. The first is to find the bottleneck device and the second is to confirm that it is such an increasable device that the processing efficiency can have an impressive promotion after a same device is added. The method for confirming the increasable bottleneck device is by judging whether the device has the total longest processing time of parallel operations. An accurate and fast method for judging parallel operations was put forward by studying parallel operations. Analysis and examples validate the method proposed can confirm the increasable bottleneck device quickly.
Job-shop scheduling parallel operation bottleneck bottleneck device
Zhiqiang Xie Yong Liu Guangjie Ye Guangyu Tan
College of Computer Science and Technology Harbin University of Science and Technology Heilongjiang Province, China
国际会议
2007 IEEE International Conference on Automation and Lofistics
山东济南
英文
2007-08-18（万方平台首次上网日期，不代表论文的发表时间）