| Article ID: | iaor20023584 |
| Country: | China |
| Volume: | 24 |
| Issue: | 1 |
| Start Page Number: | 20 |
| End Page Number: | 23 |
| Publication Date: | Jan 2001 |
| Journal: | Journal of Chongqing University |
| Authors: | Zheng Hualin, Liu Fei, Xiong Feng, Yin Chao |
| Keywords: | job shop |
This paper discusses a new approach to job-shop production scheduling with time constraints on starting and completing work. In this approach, all operations in the queue are sorted according to their values of remaining operating time, and a preliminary feasible solution for production scheduling is found, which makes a minimum circulation time of parts in the system. Then adjustment is made to the time span of the block of operations. The process is iterated until a satisfactory scheduling solution is obtained.