Abstract
For two scheduling problems (O3∥C max and AL3∥C max) tight bounds of the optima localization intervals are found in terms of lower bounds (\( \tilde C \) and \( \overset{\lower0.5em\hbox{$\smash{\scriptscriptstyle\frown}$}}{C} \), respectively) computable in linear time. The main part of the proof was made with an aid of computer. As a by-product, we obtain linear-time approximation algorithms for solving these problems with worst-case performance ratios 4/3 and 5/3, respectively.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Appel, K., Haken, W.: Every planar map is four colorable. A.M.S. Contemporary Math. 98 (1989), 741 pp.
Bárány, I., Fiala, T.: Nearly optimum solution of multimachine scheduling problems. Szigma — Mat.-Közgaz-dasági Folyóirat, 15 (1982) 177–191.
Gonzalez, T., Sahni, S.: Open shop scheduling to minimize finish time. J. Assoc. Comput. Mach., 23 (1976) 665–679.
Chen, B., Strusevich, V.A.: Approximation algorithms for three-machine open shop scheduling. ORSA Journal on Computing, 5 (1993) 321–326.
Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: Sequencing and scheduling: algorithms and complexity. Handbooks in Operations Research and Management Science, Amsterdam, 1993, Vol. 4, 445–522.
Johnson, S.M.: Optima two-and three-stage production schedules with setup times included. Naval Res. Logist. Quart., 1 (1954), 61–68.
Potts, C.N., Sevast’janov, S.V., Strusevich, V.A., Van Wassenhove, L.N., Zvaneveld, C.M.: The two-stage assembly scheduling problem: complexity and approximation. Oper. Res. 43 (1995) 346–355.
Sevastianov, S.V., Woeginger, G.J.: Makespan Minimization in Open Shops: a Polynomial Time Approximation. SFB-Report 68, Mai 1996, TU Graz, Austria.
Williamson, D.P., Hall, L.A., Hoogeveen, J.A., Hurkens, C.A.J., Lenstra, J.K., Sevastianov, S.V., Shmoys, D.B.: Short Shop Schedules. Oper. Res., 45 (1997), No.2, 288–294.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sevastianov, S.V., Tchernykh, I.D. (1998). Computer-Aided Way to Prove Theorems in Scheduling. In: Bilardi, G., Italiano, G.F., Pietracaprina, A., Pucci, G. (eds) Algorithms — ESA’ 98. ESA 1998. Lecture Notes in Computer Science, vol 1461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68530-8_42
Download citation
DOI: https://doi.org/10.1007/3-540-68530-8_42
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64848-2
Online ISBN: 978-3-540-68530-2
eBook Packages: Springer Book Archive