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

DOI10.1016/j.ejor.2014.11.037zbMath1346.90359OpenAlexW2073967547MaRDI QIDQ319016

Kyparisis, George J., Christos P. Koulamas

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)

Related Items (10)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling ordered open shops
• The mixed shop scheduling problem
• Nonstrict vector summation in multi-operation scheduling
• Makespan minimization in open shops: A polynomial time approximation scheme
• Scheduling two jobs with fixed and nonfixed routes
• Open shop scheduling with maximal machines
• When difference in machine loads leads to efficient scheduling in open shops
• Shop-scheduling problems with fixed and non-fixed machine orders of the jobs
• Complexity of mixed shop scheduling problems: A survey
• Open-shop scheduling problems with dominated machines
• On J -maximal and J -minimal Flow-Shop Schedules
• Two-Machine Super-Shop Scheduling Problem
• Approximation Algorithms for Three-Machine Open Shop Scheduling
• Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops
• Linear time approximation scheme for the multiprocessor open shop problem

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