The two-machine no-wait general and proportionate open shop makespan problem

DOI10.1016/j.ejor.2014.04.030zbMath1338.90180OpenAlexW2090643029MaRDI QIDQ296784

Christos P. Koulamas, Shrikant S. Panwalkar

Publication date: 23 June 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.04.030

zbMATH Keywords

schedulingopen shopno wait

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Related Items (6)

Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ The proportionate two-machine no-wait job shop scheduling problem ⋮ 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 ⋮ A survey of scheduling problems with no-wait in process

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling ordered open shops
• Scheduling two-machine no-wait open shops to minimize makespan
• Open shop scheduling with machine dependent processing times
• Permutation flowshop scheduling problems with maximal and minimal time lags
• Permutation flow shops with exact time lags to minimise maximum lateness
• Review of the ordered and proportionate flow shop scheduling research
• Open-shop scheduling problems with dominated machines
• Complexity of Scheduling Shops with No Wait in Process
• Unit Execution Time Shop Problems
• Flowshop sequencing problem with ordered processing time matrices: A general case
• Open Shop Scheduling to Minimize Finish Time
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• Scheduling

This page was built for publication: The two-machine no-wait general and proportionate open shop makespan problem