Skip to main content
SpringerLink
Log in

Open Shop Scheduling

  • Chapter
Handbook on Scheduling

Part of the book series: International Handbook on Information Systems ((INFOSYS))

  • 2238 Accesses

Abstract

The formulation of an open shop scheduHng problem is the same as for the flow shop problem except that the order of processing tasks comprising one job may be arbitrary.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. O. Achugbue, F. Y. Chin, Scheduling the open shop to minimize mean flow time, SIAM J. Comput. 11, 1982, 709–720.

    Article  Google Scholar 

  2. D. Applegate and W. Cook, A computational study of the job shop scheduling problem, ORSA J. Comput. 3, 1991, 149–156.

    Google Scholar 

  3. P. Brucker, J. Hurink, B. Jurisch and B. Wöstmann, A branch and bound algorithm for the open shop problem, Discrete Appl. Math. 76, 1997, 43–59.

    Article  Google Scholar 

  4. P. Brucker, B. Jurisch and A. Krämer, The job shop problem and immediate selection, Annals Oper. Res. 50, 1994, 73–114.

    Article  Google Scholar 

  5. P. Brucker, B. Jurisch, and B. Sievers, A fast branch and bound algorithm for the job shop scheduling problem, Discrete Appl. Math. 49, 1994, 107–127.

    Article  Google Scholar 

  6. P. Baptiste and C. Le Pape, A theoretical and experimental comparison of constraint propagation techniques for disjunctive scheduling, In: Proceedings of the 14th International Joint Conference on Artificial Intelligence, Montreal, 136–140, 1995.

    Google Scholar 

  7. P. Baptiste and C. Le Pape, Edge-finding constraint propagation algorithms for disjunctive and cumulative scheduling, In: Proceedings of the 15th Workshop of the U. K. Planning Special Interest Group, Liverpool, 1996.

    Google Scholar 

  8. C. Blum, Beam-ACO — Hybridizing ant colony optimization with beam search: An application to open shop scheduling, Comput. Oper. Res. 32, 2005, 1565–1591.

    Article  Google Scholar 

  9. J. Błażewicz, E. Pesch, M. Sterna, The disjunctive graph machine representation of the job shop scheduling problem, European J. Oper. Res. 127, 2000, 317–331.

    Article  Google Scholar 

  10. C. Blum, M. Sampels, An ant colony optimization algorithm for shop scheduling problems, J. Math. Modelling and Algorithms 3, 2004, 285–308.

    Article  Google Scholar 

  11. H. Bräsel, T. Tautenhahn and F. Werner, Constructive heuristic algorithms for the open shop problem, Computing 51, 1993, 95–110.

    Article  Google Scholar 

  12. S. Colak, A. Agarwal, Non-greedy heuristics and augmented neural networks for the open-shop scheduling problem, Naval Res. Logist. 52, 2005, 631–644.

    Article  Google Scholar 

  13. Y. Caseau and F. Laburthe, Disjunctive scheduling with task intervals, Technical Report 95-25, Laboratoire d’Informatique de l’Ecole Normale Superieure, Paris, 1995.

    Google Scholar 

  14. J. Carlier and E. Pinson, An algorithm for solving the job shop problem, Management Sci. 35, 1989, 164–176.

    Google Scholar 

  15. J. Carlier and E. Pinson, A practical use of Jackson’s preemptive schedule for solving the job shop problem, Annals Oper. Res. 26, 1990, 269–287, 1990.

    Google Scholar 

  16. J. Carlier and E. Pinson, Adjustments of heads and tails for the job shop problem, European J. Oper. Res. 78, 1994, 146–161.

    Article  Google Scholar 

  17. Y. Cho, S. Sahni, Preemptive scheduling of independent jobs with release and due times on open, flow and job shops, Oper. Res. 29, 1981, 511–522.

    Article  Google Scholar 

  18. U. Dorndorf, T. Phan-Huy and E. Pesch, A survey of interval capacity consistency tests for time and resource constrained scheduling, In: J. Weglarz, editor, Project Scheduling-Recent Models, Algorithms and Applications, 213–238, Kluwer Academic Publishers, Boston, 1999.

    Google Scholar 

  19. U. Dorndorf, E. Pesch and T. Phan-Huy, Constraint propagation techniques for disjunctive scheduling problems, Artificial Intelligence 122, 2000, 189–240.

    Article  Google Scholar 

  20. U. Dorndorf, E. Pesch and T. Phan-Huy, Solving the open shop scheduling problem, Journal of Scheduling 4, 2001, 157–174.

    Article  Google Scholar 

  21. C. Gueret, N. Jussien, and C. Prins, Using intelligent backtracking to improve branch and bound methods: An application to open shop problems, European J. Oper. Res. 127, 2000, 344–354.

    Article  Google Scholar 

  22. C. Gueret and C. Prins. Classical and new heuristics for the open shop problem: A computational evaluation, European J. Oper. Res. 107, 1998, 306–314, 1998.

    Article  Google Scholar 

  23. C. Gueret and C. Prins. Forbidden intervals for open-shop problems, Research Report 98/10/AUTO, Ecole de Mines de Nantes, Nantes, 1998.

    Google Scholar 

  24. C. Gueret and C. Prins, A new lower bound for the open-shop problem, Annals Oper. Res. 92, 1999, 165–183.

    Article  Google Scholar 

  25. T. Gonzalez, S. Sahni, Open shop scheduling to minimize finish time, J. Assoc. Comput. Mach. 23, 1976, 665–679.

    Google Scholar 

  26. J. Jackson, An extension on Johnson’s results on job lot scheduling, Naval Res. Logist. Quart. 3, 1956, 201–203.

    Article  Google Scholar 

  27. W. Kubiak, C. Srishkandarajah, K. Zaras, A note on the complexity of open shop scheduling problems, INFOR 29, 1991, 284–294.

    Google Scholar 

  28. C. F. Liaw, An iterative improvement approach for nonpreemptive open shop scheduling problem, European J. Oper. Res. 111, 1998, 509–517.

    Article  Google Scholar 

  29. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, Minimizing maximum lateness in a two-machine open shop, Math. Oper. Res. 6, 1981, 153–158; Erratum, Math. Oper. Res. 7, 1982, 635.

    Google Scholar 

  30. P. Martin and D. B. Shmoys, A new approach to computing optimal schedules for the job shop scheduling problem, In: Proceedings of the 5th International IPCO Conference, 1996.

    Google Scholar 

  31. W. P. M. Nuijten, Time and Resource Constrained Scheduling: A Constraint Satisfaction Approach, PhD thesis, Eindhoven University of Technology, 1994.

    Google Scholar 

  32. T. Phan-Huy, Constraint Propagation in Flexible Manufacturing, Springer, Heidelberg, 2000.

    Google Scholar 

  33. C. Prins, Competitive genetic algorithms for the open-shop scheduling problem Math. Methods of Oper. Res. 52, 2000, 389–411.

    Article  Google Scholar 

  34. A. Ramudhin and P. Marier, The generalized shifting bottleneck procedure, European J. Oper. Res. 93, 1996, 34–48.

    Article  Google Scholar 

  35. B. Roy and B. Sussmann, Les problemes d’ordonnancement avec contraintes disjonctives. Note D. S. 9, SEMA, Paris, 1964.

    Google Scholar 

  36. E. Taillard, Benchmarks for basic scheduling problems, European J. Oper. Res., 64, 1993, 278–285.

    Article  Google Scholar 

  37. E. Tsang, Foundations of Constraint Satisfaction. Academic Press, Essex, 1993.

    Google Scholar 

  38. F. Werner and A. Winkler, Insertion techniques for the heuristic solution of the job shop problem, Discrete Appl. Math. 58, 1995, 191–211.

    Article  Google Scholar 

Download references

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

(2007). Open Shop Scheduling. In: Handbook on Scheduling. International Handbook on Information Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-32220-7_9

Download citation

Publish with us

Policies and ethics

Search

Navigation