Skip to main content
SpringerLink
Log in

Chapter 4 Job shop systems

  • Part I Discrete Renewable Resources
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

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

    Article  Google Scholar 

  2. J. Błażewicz, Złożoność obliczeniowa algorytmów i problemów szeregowania zadań, Wyd. Politechniki Poznańskiej, Seria Rozprawy, No. 104, 1979.

  3. J. Błażewicz, W. Kubiak and J. Szwarcfiter, Scheduling unit-time jobs on flow-shops under resource constraints, to appear.

  4. J. Błażewicz, J.K. Lenstra and A.H.G. Rinnooy Kan, Scheduling subject to resource constraints; classification and complexity, Discrete Applied Mathematics 5, No. 1(1983)11–24.

    Article  Google Scholar 

  5. P. Brucker, Minimizing maximum lateness in a two-machine unit-time job shop, Computing 27(1981)367–370.

    Google Scholar 

  6. Y. Cho and S. Sahni, Preemptive scheduling of independent jobs with release and due times on open, flow and job shops, Operations Research 29, No. 3 (1981)511–522.

    Google Scholar 

  7. M.R. Garey and D.S. Johnson, Complexity results for multiprocessor scheduling under resource constraints, SIAM J. on Computing 4(1975)397–411.

    Article  Google Scholar 

  8. M.R. Garey, D.S. Johnson and R. Sethi, The complexity of flowshop and jobshop scheduling, Mathematics of Operations Research 1, No. 2(1976)117–129.

    Google Scholar 

  9. T. Gonzalez, A note on open shop preemptive schedules, IEEE Trans. Computers C-28(1979)782–786.

    Google Scholar 

  10. T. Gonzalez and S. Sahni, Open shop scheduling to minimize finish time, J. ACM (1976)665–679.

  11. T. Gonzalez and S. Sahni, Flowshop and jobshop schedules: complexity and approximation, Operations Research 26, No. 1(1978)36–52.

    Google Scholar 

  12. J.R. Jackson, An extension of Johnson's results on job lot scheduling, Naval Res. Logist. Quart. 3(1956)201–203.

    Google Scholar 

  13. S.M. Johnson, Optimal two-and-three-stage production schedules, Naval Research Logistics Quarterly 1, No. 1(1954)61–68.

    Google Scholar 

  14. B.J. Lageweg, unpublished.

  15. B.J. Lageweg and J.K. Lenstra, unpublished.

  16. E.L. Lawler, unpublished.

  17. E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, Minimizing maximum lateness in two machine open shop, Mathematics of Operations Research 6(1981)153–158.

    Google Scholar 

  18. J.K. Lenstra, unpublished.

  19. J.K. Lenstra, A.H.G. Rinnooy Kan and P. Brucker, Complexity of machine scheduling problems, Ann. Discrete Math. 1(1977)343–362.

    Google Scholar 

  20. H. Röck, Scheduling unit task shops with resource constraints and excess usage costs, Report 83-21, Fachbereich Informatik, Technical University of Berlin, 1983.

  21. H. Röck, The three-machine no-wait flow shop problem is NP-complete, J. ACM 31, No. 2 (1984)336–345.

    Article  Google Scholar 

  22. H. Röck, Some new results in flow shop scheduling, Zeitschrift für Operations Res. 28(1984)1–16.

    Article  Google Scholar 

  23. H. Röck, private communication.

  24. R. Słowiński, Cost-minimal preemptive scheduling of independent jobs with release and due dates on open shop under resource constraints, Information Processing Letters 9, No. 5 (1979)233–237.

    Article  Google Scholar 

  25. R. Słowiński, Algorithms for the allocation of resources of different categories in the complex of operations framework (in Polish), Technical University of Poznań Press, ser. Rozprawy, No. 114, Poznań, 1980.

  26. D. de Werra, Preemptive scheduling, linear programming and network flows, SIAM J. Algebraic Discrete Meth. 5, No. 1 (1984)11–20.

    Google Scholar 

Download references

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chapter 4 Job shop systems. Ann Oper Res 7, 133–150 (1986). https://doi.org/10.1007/BF02186436

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02186436

Keywords

Search

Navigation