Abstract
Dense schedules are easy to construct and can be used as heuristic solutions for open-shop problems. It is conjectured that in the worst-case a dense schedule will result in a makespan no more than \((2-\frac{1}{m})\) times of the makespan of the optimal schedule, where m is the number of machines. Different approaches have been used in proofs for different number of machines. The conjecture has been proved for the number of machines m≤6, and for some special types of dense schedules. In this paper, we first summarize some useful properties of dense schedules, and then provide some special types of dense schedules that make the conjecture hold. Finally, we give complete proofs of the conjecture for m=7 and 8.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Adiri, I., & Aizikowitz, N. (1989). Open-shop scheduling problems with dominated machines. Naval Research Logistics, 36(3), 273–281.
Barany, I., & Fiala, T. (1982). Nearly optimum solution of multimachine scheduling problems (in Hungarian). Szigma, 15(3), 177–191.
Brucker, P., Hurink, J., Jurisch, B., & Wostmann, B. (1997). A branch & bound algorithm for the open-shop problem. Discrete Applied Mathematics, 76, 43–59.
Chen, B., & Strusevich, V. A. (1993). Approximation algorithms for three machine open shop scheduling. ORSA Journal on Computing, 5, 321–328.
Chen, B., & Yu, W. (2001). How good is a Dense Shop Schedule? Acta Mathematics Application Sinica, 17(1), 121–128.
Chen, R. (2003). Open shop scheduling problems and their dense schedules. Ph.D. Thesis, East China University of Science and Technology.
Chen, R., & Yu, W. (2003). Analysis of operation chain’s properties of dense schedules for open-shop. Journal of East China University of Science and Technology, 29(5), 522–526.
Chen, X., & Yu, W. (2000). Upper-bound of performance ratio of dense schedules for open-shop (in Chinese). Journal of East China University of Science and Technology, 26(6), 670–673.
Dorndorf, U., Pesch, E., & Phan-Huy, T. (2001). Solving the open shop scheduling problem. Journal of Scheduling, 4, 157–174.
Drobouchevich, I. G., & Strusevich, V. A. (1999). A polynomial algorithm for the three-machine open shop with a bottleneck machine. Annals of Operations Research, 92, 185–210.
Drobouchevich, I. G., & Strusevich, V. A. (2001). Two-stage open shop scheduling with a bottleneck machine. EJOR, 128, 159–174.
Fiala, T. (1983). An algorithm for the open-shop problem. Mathematics of Operations Research, 8(1), 100–109.
Gonzalez, T., & Sahni, S. (1976). Open shop scheduling to minimize finish time. Journal of the Association for Computing Machinery, 23(4), 665–679.
Kononov, A., Sevastianov, S., & Tchermykh, I. (1999). When difference in machine loads leads to efficient scheduling in open shops. Annals of Operations Research, 92, 211–239.
Sevastianov, S. V. (1992). A polynomial-time open-shop problem with an arbitrary number of machines. Cybernetics and Systems Analysis, 28(6), 918–933.
Sevastianov, S. V., & Woeginger, G. J. (1998). Makespan minimization in open shops: a polynomial time approximation scheme. Mathematical Programming, 82, 191–198.
Volchkova, G. P. (2004). On a conjecture on dense open-shop schedules (in Russian). Vestnik Belorusskogo Gosudarstvennogo Universiteta, Seria 1, Fizika, Matematika, Informatika, 2, 58–61.
Williamson, D. P., Hall, L. A., Hoogeveen, J. A., Hurkens, C. A. J., Lenstra, J. K., Sevastianov, S. V. et al. (1997). Short shop schedules. Operations Research, 45(2), 288–294.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Chen, R., Huang, W., Men, Z. et al. Open-shop dense schedules: properties and worst-case performance ratio. J Sched 15, 3–11 (2012). https://doi.org/10.1007/s10951-009-0128-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-009-0128-6