Asymptotic analysis of online algorithms and improved scheme for the flow shop scheduling problem with release dates

DOI10.1080/00207721.2013.843736zbMath1332.90118OpenAlexW2136439337MaRDI QIDQ2792935

Danyu Bai

Publication date: 14 March 2016

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

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

zbMATH Keywords

schedulinglocal searchflow shopasymptotic analysis of algorithmtotal quadratic completion time

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

Related Items (2)

Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates ⋮ A local search algorithm for the flow shop scheduling problem with release dates

Cites Work

• Optimal two- and three-stage production schedules with setup times included
• Fifty years of scheduling: a survey of milestones
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• On the Asymptotic Optimality of the SPT Rule for the Flow Shop Average Completion Time Problem
• On the asymptotic optimality of algorithms for the flow shop problem with release dates
• On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem
• Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
• Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates

This page was built for publication: Asymptotic analysis of online algorithms and improved scheme for the flow shop scheduling problem with release dates