Access the full text.
Sign up today, get DeepDyve free for 14 days.
Zeynep Adak, M. Akan, Serol Bulkan (2020)
Multiprocessor open shop problem: literature review and future directionsJournal of Combinatorial Optimization, 40
B. Naderi, S. Ghomi, M. Aminnayeri, M. Zandieh (2011)
Scheduling open shops with parallel machines to minimize total completion timeJ. Comput. Appl. Math., 235
R. McNaughton (1959)
Scheduling with Deadlines and Loss FunctionsManagement Science, 6
Marie Matta, Sarah Patterson (2007)
Evaluating multiple performance measures across several dimensions at a multi-facility outpatient centerHealth Care Management Science, 10
T. Gonzalez, S. Sahni (1976)
Open Shop Scheduling to Minimize Finish TimeJ. ACM, 23
Pengfei Zhang, J. Bard, D. Morrice, Karl Koenig (2019)
Extended open shop scheduling with resource constraints: Appointment scheduling for integrated practice unitsIISE Transactions, 51
Yong Chen, An Zhang, Guangting Chen, J. Dong (2013)
Approximation algorithms for parallel open shop schedulingInf. Process. Lett., 113
E. Buffa (1977)
Graph Theory with ApplicationsJournal of the Operational Research Society
I Bárány (1982)
177Szigma, 15
J. Dong, Ruyan Jin, Jue-liang Hu, Guohui Lin (2018)
A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshopsJournal of Combinatorial Optimization, 37
É. Tardos (1986)
A Strongly Polynomial Algorithm to Solve Combinatorial Linear ProgramsOper. Res., 34
Marie Matta (2009)
A genetic algorithm for the proportionate multiprocessor open shopComput. Oper. Res., 36
K. Jansen, M. Sviridenko (2000)
Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem
E. Lawler, M. Luby, V. Vazirani (1982)
Scheduling open shops with parallel machinesOper. Res. Lett., 1
Marie Matta, S. Elmaghraby (2010)
Polynomial time algorithms for two special classes of the proportionate multiprocessor open shopEur. J. Oper. Res., 201
[Two models of open shops with multiprocessors have been evolved: the single-operation machine and multiple-operation machine models. The former replaces a single machine in each stage by parallel machines, typically identical, but limits processing of an operation to machines from one stage. The latter permits processing an operation on a set of machines possibly from different stages. The research has focused mainly on makespan minimization. For the preemptive schedules the makespan minimization is done by a two-phase approach in polynomial time. The first phase optimally allocates operations to machines. The second phase applies algorithms for makespan minimization for preemptive open shops to find optimal schedules for the allocations. The approach gives polynomial-time algorithms for both models. The non-preemptive case is NP-hard in the strong sense. The chapter presents a 2-approximation algorithm for an arbitrary number of machines and reviews approximation schemes for a fixed number of stages for the case. Those approximation algorithms have been obtained for the single-operation machine model. Finally, the chapter reviews applications of multiprocessors to health care and other areas.]
Published: Oct 31, 2021
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.