Annals of Operations Research

, Volume 83, Issue 0, pp 253–270 | Cite as

A greedy open shop heuristic with job priorities

  • V.A. Strusevich

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    V.A. Aksjonov, A polynomial-time algorithm of approximate solution of a scheduling problem, Upravlyaemye Sistemy 28(1988)8–11 (in Russian).Google Scholar
  2. [2]
    I. Bárány and T. Fiala, Nearly optimum solution of multimachine scheduling problems, Szigma 15(1982)177–191 (in Hungarian).Google Scholar
  3. [3]
    B. Chen and V.A. Strusevich, Approximation algorithms for three machine open shop scheduling, ORSA J. Comput. 5(1993)321–326.Google Scholar
  4. [4]
    B. Chen and V.A. Strusevich, Worst-case analysis of heuristics for open shops with parallel machines, Eur. J. Oper. Res. 70(1993)379–390.CrossRefGoogle Scholar
  5. [5]
    T. Gonzalez and S. Sahni, Open shop scheduling to minimize finish time, J. Assoc. Comput. Mach. 23(1976)665–679.Google Scholar
  6. [6]
    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
  7. [7]
    S.V. Sevast'janov, Efficient scheduling in the open shop systems, Siber. J. Oper. Res. 1(1994)20–42 (in Russian).Google Scholar
  8. [8]
    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
  9. [9]
    J.M. Wein, Algorithms for Scheduling and Network Problems, Ph.D. Thesis, Cambridge, USA, 1991.Google Scholar
  10. [10]
    D. Williamson, L.A. Hall, J.A. Hoogeveen, C.A.J. Hurkens, J.K. Lenstra, S.V. Sevast'janov and D.B. Shmoys, Short shop schedules, Oper. Res. 45(1997)288–294.CrossRefGoogle Scholar

Copyright information

© Kluwer Academic Publishers 1998

Authors and Affiliations

  • V.A. Strusevich

There are no affiliations available

Personalised recommendations