BibTeX
@MISC{Zhenbo_parallelmachine,
author = {Wang Zhenbo and Xing Wenxun},
title = {Parallel Machine Scheduling with Special Jobs },
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This paper considers parallel machine scheduling with special jobs. Normal jobs can be processed on any of the parallel machines, while the special jobs can only be processed on one machine. The problem is analyzed for various manufacturing conditions and service requirements. The off-line scheduling problem is transformed into a classical parallel machine scheduling problem. The on-line scheduling uses the FCFS, SWSC and FFFS algorithms to satisfy the various requirements. Furthermore, this paper proves that FCFS has a competitive ratio of m, where m is the number of parallel machines, and this bound is asymptotically tight, SWSC has a competitive ratio of 2 2 and FFFS has a competitive ratio3 − , and these bounds are tight.
