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

DOI10.1016/J.COR.2012.02.020zbMATH Open1251.90196OpenAlexW2046579079MaRDI QIDQ1761237FDOQ1761237

Cheng Wu, Shiji Song, Jatinder N. D. Gupta, Cheng Wang

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)

Cites Work

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

Cited In (10)

• A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion
• Title not available (Why is that?)
• Constraint guided accelerated search for mixed blocking permutation flowshop scheduling
• 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 new algorithm for minimizing makespan, C_max, in blocking flow-shop problem through slowing down the operations
• 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
• Algorithms for three-machine flowshop scheduling problem to minimize makespan with uncertain processing times
• Estimation of distribution algorithm with path relinking for the blocking flow-shop scheduling problem

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

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