Open shop scheduling with maximal machines

DOI10.1016/S0166-218X(97)00018-8zbMath0893.90091MaRDI QIDQ1377665

Christos P. Koulamas, Kyparisis, George J.

Publication date: 26 January 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

polynomial algorithmsopen shop makespan problem

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Some positive news on the proportionate open shop problem ⋮ The three-machine proportionate open shop and mixed shop minimum makespan problems ⋮ 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

Cites Work

• Scheduling ordered open shops
• A Note On The Complexity Of Openshop Scheduling Problems
• A concise survey of efficiently solvable special cases of the permutation flow-shop problem
• Open-shop scheduling problems with dominated machines
• Open Shop Scheduling to Minimize Finish Time
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• An Algorithm for the Open-Shop Problem
• Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops

This page was built for publication: Open shop scheduling with maximal machines