A greedy open shop heuristic with job priorities
From MaRDI portal
Publication:1273127
DOI10.1023/A:1018964131329zbMath0911.90223OpenAlexW1580971502MaRDI QIDQ1273127
Publication date: 6 December 1998
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018964131329
approximation algorithmmakespanworst-case analysisopen shop schedulinggreedy open shop approximation algorithmpre-ordering of jobs
Related Items (6)
A PTAS for non-resumable open shop scheduling with an availability constraint ⋮ New efficient heuristics for scheduling open shops with makespan minimization ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ Open shop scheduling problem with a non-resumable flexible maintenance period ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan
This page was built for publication: A greedy open shop heuristic with job priorities
