The paper presents an improved version of the greedy open shop approximation algorithm with pre-ordering of jobs. It is shown that the algorithm compares favorably with the greedy algorithm with no pre-ordering by reducing either its absolute or relative error. In the case of three machines, the new algorithm creates a schedule with the makespan that is at most 3/2 times the optimal value.
Unable to display preview. Download preview PDF.
- V.A. Aksjonov, A polynomial-time algorithm of approximate solution of a scheduling problem, Upravlyaemye Sistemy 28(1988)8–11 (in Russian).Google Scholar
- I. Bárány and T. Fiala, Nearly optimum solution of multimachine scheduling problems, Szigma 15(1982)177–191 (in Hungarian).Google Scholar
- B. Chen and V.A. Strusevich, Approximation algorithms for three machine open shop scheduling, ORSA J. Comput. 5(1993)321–326.Google Scholar
- T. Gonzalez and S. Sahni, Open shop scheduling to minimize finish time, J. Assoc. Comput. Mach. 23(1976)665–679.Google Scholar
- E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, Sequencing and scheduling: Algorithms and complexity, in: Handbook in Operations Research and Management Science, Vol. 4, Logistics of Production and Inventory, eds. S.C. Graves et al., North-Holland, Amsterdam, 1993, pp.445–452.Google Scholar
- S.V. Sevast'janov, Efficient scheduling in the open shop systems, Siber. J. Oper. Res. 1(1994)20–42 (in Russian).Google Scholar
- D.B. Shmoys, C. Stein and J.M. Wein, Algorithms for shop scheduling problems, in: Proceedings of the 2nd ACM–SIAM Symposium on Discrete Algorithms, 1991, pp. 148–157.Google Scholar
- J.M. Wein, Algorithms for Scheduling and Network Problems, Ph.D. Thesis, Cambridge, USA, 1991.Google Scholar