Minimizing Cycle Time in a Blocking Flowshop

DOI10.1287/opre.48.1.177.12451zbMath1106.90334OpenAlexW2035133691MaRDI QIDQ4530646

Nicholas G. Hall, Isa Nakhai Kamal Abadi, Chelliah Skriskandarajah

Publication date: 4 June 2002

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.48.1.177.12451

Mathematics Subject Classification ID

Stochastic programming (90C15) Stochastic scheduling theory in operations research (90B36)

Related Items (15)

Optimal versus heuristic scheduling of surface mount technology lines ⋮ Resolution of a scheduling problem in a flowshop robotic cell ⋮ Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion ⋮ On no-wait and no-idle flow shops with makespan criterion ⋮ A faster polynomial algorithm for 2-cyclic robotic scheduling ⋮ A comparative study on three graph-based constructive algorithms for multi-stage scheduling with blocking ⋮ A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion ⋮ A three-phase algorithm for flowshop scheduling with blocking to minimize makespan ⋮ Analysis of flow shop scheduling anomalies ⋮ Scheduling manufacturing systems with blocking: a Petri net approach ⋮ Flowshop-scheduling problems with makespan criterion: a review ⋮ A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems ⋮ An optimization-based heuristic for the robotic cell problem ⋮ A review of TSP based approaches for flowshop scheduling ⋮ A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking

This page was built for publication: Minimizing Cycle Time in a Blocking Flowshop