Preemptive open shop scheduling with multiprocessors: polynomial cases and applications
- 105 Downloads
This paper addresses a multiprocessor generalization of the preemptive open-shop scheduling problem. The set of processors is partitioned into two groups and the operations of the jobs may require either single processors in either group or simultaneously all processors from the same group. We consider two variants depending on whether preemptions are allowed at any fractional time points or only at integer time points. We reduce the former problem to solving a linear program in strongly polynomial time, while a restricted version of the second problem is solved by rounding techniques. Applications to course scheduling and hypergraph edge coloring are also discussed.
KeywordsPreemptive open shop scheduling Multiprocessor operations Polynomial time algorithms
Unable to display preview. Download preview PDF.
- Berge, C. (1973). Graphs and hypergraphs. Amsterdam: North-Holland. Google Scholar
- Błażewicz, J., Ecker, K. H., Pesch, E., Schmidt, G., & Weglarz, J. (1996). Scheduling computer and manufacturing processes. Berlin: Springer. Google Scholar
- Burke, E. K., Kingston, J. H., & De Werra, D. (2004). In J. Gross & J. Yellen (Eds.), Handbook of graph theory, Applications to timetabling (pp. 445–474). London/Boca Raton: Chapman Hall/CRC Press. Google Scholar
- de Werra, D., & Kis, T. (2001). Some solvable cases of preemptive open shop scheduling with multiprocessors. ORWP 01/07, Department of Mathematics, Lausanne: Swiss Federal Institute of Technology. Google Scholar
- Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a guide to the theory of NP-completeness. San Francisco: Freeman. Google Scholar
- Petrovic, S., & Burke, E. K. (2004). In J. Leung (Ed.), Handbook of scheduling: algorithms, models, and performance analysis. University timetabling. Boca Raton: CRC Press, Chapter 45. Google Scholar