Open shop scheduling problem to minimize makespan with release dates

DOI10.1016/j.apm.2012.04.037zbMath1349.90312OpenAlexW2047993234MaRDI QIDQ346082

Lixin Tang, Danyu Bai

Publication date: 5 December 2016

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2012.04.037

zbMATH Keywords

schedulingmakespanopen shop problemperformance analysis of algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (5)

Flexible open shop scheduling problem to minimize makespan ⋮ A novel complex network based dynamic rule selection approach for open shop scheduling problem with release dates ⋮ A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem

This page was built for publication: Open shop scheduling problem to minimize makespan with release dates