On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem

DOI10.1080/00207721.2012.748943zbMath1291.90104OpenAlexW2016624735MaRDI QIDQ5168014

Zhi-Hai Zhang, Danyu Bai

Publication date: 3 July 2014

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207721.2012.748943

zbMATH Keywords

schedulinglocal searchasymptotic analysisopen shoptotal quadratic completion time

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

Related Items (3)

An extended study on an open-shop scheduling problem using the minimisation of the sum of quadratic completion times ⋮ Hybrid multi-objective optimisation for concurrent activities consolidating two docked spacecraft ⋮ Asymptotic analysis of online algorithms and improved scheme for the flow shop scheduling problem with release dates

Cites Work

• Unnamed Item
• Open shop scheduling problem to minimize makespan with release dates
• A new heuristic for open shop total completion time problem
• Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan
• Fifty years of scheduling: a survey of milestones
• Scheduling the Open Shop to Minimize Mean Flow Time
• Unit Execution Time Shop Problems
• Open Shop Scheduling to Minimize Finish Time
• The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem