The three-machine proportionate open shop and mixed shop minimum makespan problems

DOI10.1016/J.EJOR.2014.11.037MaRDI QIDQ319016zbMATH OpenOpenAlexFDO

Authors C. Koulamas, George J. Kyparisis

Publication date 6 October 2016

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2014.11.037

zbMATH Keywords

schedulingopen shopmixed shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Approximation algorithms for the three-machine proportionate mixed shop scheduling
• Approximation Algorithms for Three-Machine Open Shop Scheduling
• Approximation algorithms and a hardness result for the three-machine proportionate mixed shop
• Some positive news on the proportionate open shop problem
• The three-machine proportionate flow shop problem with unequal machine speeds

Cites work

• scientific article; zbMATH DE number 1300389 (Why is no real title available?)
• scientific article; zbMATH DE number 1305102 (Why is no real title available?)
• scientific article; zbMATH DE number 830382 (Why is no real title available?)
• Approximation Algorithms for Three-Machine Open Shop Scheduling
• Complexity of mixed shop scheduling problems: A survey
• Linear time approximation scheme for the multiprocessor open shop problem
• Makespan minimization in open shops: A polynomial time approximation scheme
• Nonstrict vector summation in multi-operation scheduling
• On J -maximal and J -minimal Flow-Shop Schedules
• Open shop scheduling with maximal machines
• Open-shop scheduling problems with dominated machines
• Scheduling ordered open shops
• Scheduling two jobs with fixed and nonfixed routes
• Shop-scheduling problems with fixed and non-fixed machine orders of the jobs
• The mixed shop scheduling problem
• Two-Machine Super-Shop Scheduling Problem
• Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops
• When difference in machine loads leads to efficient scheduling in open shops

Cited in

(14)

• The two-machine no-wait general and proportionate open shop makespan problem
• Approximation algorithms and a hardness result for the three-machine proportionate mixed shop
• The three-machine proportionate flow shop problem with unequal machine speeds
• On the complexity of proportionate open shop and job shop problems
• Approximation algorithms for the three-machine proportionate mixed shop scheduling
• Shop scheduling problems with pliable jobs
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop
• Some positive news on the proportionate open shop problem
• The LPT heuristic for minimizing total load on a proportionate openshop
• Exponential tightness for integral-type functionals of centered independent differently distributed random variables
• Three-machine shop scheduling with partially ordered processing routes
• Flow shops with reentry: reversibility properties and makespan optimal schedules

This page was built for publication: The three-machine proportionate open shop and mixed shop minimum makespan problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319016)