A three-phase algorithm for flowshop scheduling with blocking to minimize makespan

DOI10.1016/j.cor.2012.02.020zbMath1251.90196OpenAlexW2046579079MaRDI QIDQ1761237

Cheng Wu, Jatinder N. D. Gupta, Cheng Wang, Shi-ji Song

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.02.020

zbMATH Keywords

priority rulepruning procedureflowshop scheduling with zero-buffer and blockingNEH-insertsimulated annealing with local searchthree-phase algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Constraint guided accelerated search for mixed blocking permutation flowshop scheduling ⋮ Estimation of distribution algorithm with path relinking for the blocking flow-shop scheduling problem ⋮ Optimizing blocking flow shop scheduling problem with total completion time criterion ⋮ A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion ⋮ Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion ⋮ Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption ⋮ A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
• A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems
• Sequencing of jobs in some production system
• Benchmarks for basic scheduling problems
• Optimal planning of part's machining on a number of machines
• Flowshop scheduling research after five decades
• Complexity of flowshop scheduling problems with a new blocking constraint
• Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
• Flowshop sequencing problems with limited buffer storage
• Minimizing Cycle Time in a Blocking Flowshop
• Lower bounding schemes for flowshops with blocking in-process
• A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
• On the Flow-Shop Sequencing Problem with No Wait in Process^†
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process

This page was built for publication: A three-phase algorithm for flowshop scheduling with blocking to minimize makespan