Open-shop scheduling problems with dominated machines

DOI10.1002/NAV.3220360305zbMath0676.90031OpenAlexW2040444734MaRDI QIDQ3832309

N. Hefetz, Igal Adiri

Publication date: 1989

Published in: Naval Research Logistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3220360305

zbMATH Keywords

open-shop schedulingthree-machine problemschedule lengthdominated machine

Mathematics Subject Classification ID

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

Related Items (12)

The two-machine no-wait general and proportionate open shop makespan 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 ⋮ Open shop scheduling with maximal machines ⋮ Open-shop dense schedules: properties and worst-case performance ratio ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Open shop scheduling with machine dependent processing times ⋮ The museum visitor routing problem ⋮ Scheduling ordered open shops ⋮ An iterative improvement approach for the nonpreemptive open shop scheduling problem ⋮ SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM ⋮ A hybrid genetic algorithm for the open shop scheduling problem

This page was built for publication: Open-shop scheduling problems with dominated machines