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

DOI10.1080/00207721.2012.748943zbMATH Open1291.90104OpenAlexW2016624735MaRDI QIDQ5168014FDOQ5168014

Authors: Danyu Bai, Zhi-Hai Zhang 

Publication date: 3 July 2014

Published in: International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)

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

Recommendations

• 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
• Heuristic constructive algorithms for open shop scheduling to minimize mean flow time
• New efficient heuristics for scheduling open shops with makespan minimization
• Flexible open shop scheduling problem to minimize makespan

zbMATH Keywords

local searchasymptotic analysisschedulingopen shoptotal quadratic completion time

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

Cites Work

• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Title not available (Why is that?)
• Open Shop Scheduling to Minimize Finish Time
• Fifty years of scheduling: a survey of milestones
• Unit Execution Time Shop Problems
• Scheduling the Open Shop to Minimize Mean Flow Time
• The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
• 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

Cited In (5)

• Asymptotic analysis of online algorithms and improved scheme for the flow shop scheduling problem with release dates
• 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
• 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

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

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