Proportionate and Ordered Open Shops

Wieslaw Kubiak
Additional contact information
Wieslaw Kubiak: Memorial University of Newfoundland

Chapter Chapter 7 in A Book of Open Shop Scheduling, 2022, pp 165-192 from Springer

Abstract: Abstract Two models of proportionate open shops have evolved. The job-proportionate open shops, where all operations of each job have the same processing time, and machine-proportionate open shops, where all operations on each machine have the same processing time. The two are equivalent for makespan minimization but not for other objective functions. Somewhat surprisingly the makespan minimization remains NP-hard for three-machine job-proportionate open shops. We present 7 6 $$\frac {7}{6}$$ -algorithm for the problem and propose a new approach to the makespan minimization in proportionate open shops with arbitrary number of machines. The approach uses bin packing to improve the solutions for the machine-proportionate open shops with n

Date: 2022
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-3-030-91025-9_7

Ordering information: This item can be ordered from
http://www.springer.com/9783030910259

DOI: 10.1007/978-3-030-91025-9_7

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().