Skip to main content
SpringerLink
Log in

Open Shops (Deterministic)

  • Chapter
  • First Online:
Scheduling

  • 10k Accesses

Abstract

This chapter deals with multi-operation models that are different from the job shop models considered in the previous chapter. In a job shop each job has a fixed route that is predetermined. In practice, it often occurs that the route of the job is immaterial and up to the scheduler to decide. When the routes of the jobs are open, the model is referred to as an open shop.

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 54.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
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

References

  • J.O. Achugbue and F.Y. Chin (1982) “Scheduling the Open Shop to Minimize Mean Flow Time”, SIAM Journal of Computing, Vol. 11, pp. 709–720.

    Article  MATH  Google Scholar 

  • P. Brucker, B. Jurisch, and M. Jurisch (1993) “Open Shop Problems with Unit Time Operations”, Zeitschrift für Operations Research, Vol. 37, pp. 59–73.

    MathSciNet  MATH  Google Scholar 

  • Y. Cho and S. Sahni (1981) “Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops”, Operations Research, Vol. 29, pp. 511–522.

    Article  MathSciNet  MATH  Google Scholar 

  • G. Galambos and G.J. Woeginger (1995) “Minimizing the Weighted Number of Late Jobs in UET Open Shops”, ZOR-Mathematical Methods of Operations Research, Vol. 41, pp. 109–114.

    Article  MathSciNet  MATH  Google Scholar 

  • T. Gonzalez (1979) “A Note on Open Shop Preemptive Schedules”, IEEE Transactions on Computers, Vol. C-28, pp. 782–786.

    Article  Google Scholar 

  • T. Gonzalez and S. Sahni (1976) “Open Shop Scheduling to Minimize Finish Time”, Journal of the Association of Computing Machinery, Vol. 23, pp. 665–679.

    Article  MathSciNet  MATH  Google Scholar 

  • S.A. Kravchenko (2000) “On the Complexity of Minimizing the Number of Late Jobs in Unit Time Open Shops”, Discrete Applied Mathematics, Vol. 100, pp. 127–132.

    Article  MathSciNet  MATH  Google Scholar 

  • E.L. Lawler and J. Labetoulle (1978) “On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming”, Journal of the Association of Computing Machinery, Vol. 25, pp. 612–619.

    Article  MathSciNet  MATH  Google Scholar 

  • E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan (1981) “Minimizing Maximum Lateness in a Two-Machine Open Shop”, Mathematics of Operations Research, Vol. 6, pp. 153–158; Erratum Vol. 7, pp. 635.

    Google Scholar 

  • J.Y.-T. Leung, H. Li and M. Pinedo (2005a) “Order Scheduling in an Environment with Dedicated Machines in Parallel”, Journal of Scheduling, Vol. 8, pp. 355–386.

    Article  MathSciNet  MATH  Google Scholar 

  • J.Y.-T. Leung, H. Li and M. Pinedo (2005b) “Order Scheduling Models: An Overview”, in Multidisciplinary Scheduling - Theory and Applications, G. Kendall, E. Burke, S. Petrovic, and M. Gendreau (eds.), (Selected Papers from the 1st MISTA Conference held in Nottingham, UK, August 2003), Springer, pp. 37–53.

    Google Scholar 

  • J.Y.-T. Leung, H. Li and M. Pinedo (2006) “Approximation Algorithms for Minimizing Total Weighted Completion Time of Orders on Identical Machines in Parallel”, Naval Research Logistics, Vol. 53, pp. 243–260.

    Article  MathSciNet  MATH  Google Scholar 

  • J.Y.-T. Leung, H. Li, M. Pinedo and C. Sriskandarajah (2005) “Open Shops with Jobs Overlap - Revisited”, European Journal of Operational Research, Vol. 163, pp. 569–571.

    Article  MathSciNet  MATH  Google Scholar 

  • C.Y. Liu and R.L. Bulfin (1985) “On the Complexity of Preemptive Open-Shop Scheduling Problems”, Operations Research Letters, Vol. 4, pp. 71–74.

    Article  MathSciNet  MATH  Google Scholar 

  • A.W. Marshall and I. Olkin (1979) Inequalities: Theory of Majorization and its Applications, Academic Press, New York.

    MATH  Google Scholar 

  • C.T. Ng, T.C.E. Cheng and J.J. Yuan (2003) “Concurrent Open Shop Scheduling to Minimize the Weighted Number of Tardy Jobs”, Journal of Scheduling, Vol. 6, pp. 405–412.

    Article  MathSciNet  MATH  Google Scholar 

  • T.A. Roemer (2006) “A Note on the Complexity of the Concurrent Open Shop Problem”, Journal of Scheduling, Vol. 9, pp. 389–396.

    Article  MathSciNet  MATH  Google Scholar 

  • S.V. Sevastianov and G. Woeginger (1998) “Makespan Minimization in Open Shops: a Polynomial Time Approximation Scheme”, Mathematical Programming, Vol. 82, pp. 191–198.

    MathSciNet  MATH  Google Scholar 

  • C.S. Sung and S.H. Yoon (1998) “Minimizing Total Weighted Completion Time at a Pre-Assembly Stage Composed of Two Feeding Machines”, International Journal of Production Economics, Vol. 54, pp. 247–255.

    Article  Google Scholar 

  • T. Tautenhahn and G.J. Woeginger (1997) “Minimizing the Total Completion Time in a Unit Time Open Shop with Release Times”, Operations Research Letters, Vol. 20, pp. 207–212.

    Article  MathSciNet  MATH  Google Scholar 

  • G. Vairaktarakis and S. Sahni (1995) “Dual Criteria Preemptive Open-Shop Problems with Minimum Makespan” Naval Research Logistics, Vol. 42, pp. 103–122.

    MATH  Google Scholar 

  • E. Wagneur and C. Sriskandarajah (1993) “Open Shops with Jobs Overlap”, European Journal of Operational Research, Vol. 71, pp. 366–378.

    Article  MATH  Google Scholar 

  • J. Yang and M.E. Posner (2005) “Scheduling Parallel Machines for the Customer Order Problem”, Journal of Scheduling, Vol. 8, pp. 49–74.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IOMS Dept Rm 8-59 KMC, NYU Stern School of Business, New York, NY, USA

    Michael L. Pinedo

Authors
  1. Michael L. Pinedo
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Pinedo, M.L. (2016). Open Shops (Deterministic). In: Scheduling. Springer, Cham. https://doi.org/10.1007/978-3-319-26580-3_8

Download citation

Publish with us

Policies and ethics

Search

Navigation