Open shop scheduling problem to minimize makespan with release dates

DOI10.1016/J.APM.2012.04.037MaRDI QIDQ346082zbMATH OpenOpenAlexFDO

Authors Danyu Bai, Lixin Tang

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)

Recommendations

• Dense open-shop schedules with release times
• scientific article; zbMATH DE number 1053659
• Flexible open shop scheduling problem to minimize makespan
• The further study of dense schedule performance ratio for three-machine open-shop problems with job release times
• A linear time approximation scheme for makespan minimization in an open shop with release dates

Cited in

(13)

• A novel complex network based dynamic rule selection approach for open shop scheduling problem with release dates
• Flexible open shop scheduling problem to minimize makespan
• Dense open-shop schedules with release times
• Asymptotic analysis of online algorithms and improved scheme for the flow shop scheduling problem with release dates
• On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem
• The further study of dense schedule performance ratio for three-machine open-shop problems with job release times
• Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan
• A linear time approximation scheme for makespan minimization in an open shop with release dates
• Open shop scheduling with makespan and total completion time criteria
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• Open shop problem with zero-one time operations and integer release date/deadline intervals
• Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function
• A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q346082)