| Article ID: | iaor2005516 |
| Country: | China |
| Volume: | 8 |
| Issue: | 3 |
| Start Page Number: | 25 |
| End Page Number: | 28 |
| Publication Date: | Jun 2003 |
| Journal: | Journal of Harbin University of Science and Technology |
| Authors: | Wang Zhiqiang, Chen Dongxue, Wang Hongxin |
For the nonstandard job-shop scheduling problem in which some operations are processed on several identical machines, the objective function of queue and machine load balancing presents a nonstandard scheduling problem. In this paper we develop an appropriate algorithm. Through theoretical analysis and practical verification, experiments indicated that schedules which result from the algorithm compare well with other ways to solve this kind of problem.