A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers

DOI10.1016/j.cor.2007.11.004zbMath1157.90429OpenAlexW2019270990MaRDI QIDQ955624

Lixin Tang, Xianpeng Wang

Publication date: 20 November 2008

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

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

zbMATH Keywords

tabu searchscatter searchhybrid flowshop schedulingfinite intermediate buffer

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective ⋮ A discrete inter-species cuckoo search for flowshop scheduling problems ⋮ A hybrid flowshop scheduling problem for a cold treating process in seamless steel tube production ⋮ Hybrid flowshop scheduling with machine and resource-dependent processing times ⋮ A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints ⋮ The hybrid flow shop scheduling problem ⋮ A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility ⋮ A Pareto-based adaptive variable neighborhood search for biobjective hybrid flow shop scheduling problem with sequence-dependent setup time

Cites Work

• Some efficient heuristic methods for the flow shop sequencing problem
• The scheduling problem where multiple machines compete for a common local buffer
• Preemptive scheduling with finite capacity input buffers
• A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities.
• The permutation flow shop with buffers: A tabu search approach
• A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
• An effective hybrid genetic algorithm for flow shop scheduling with limited buffers
• Scatter search for the vehicle routing problem with time windows
• Some aspects of scatter search in the flow-shop problem
• Scheduling with Finite Capacity Output Buffers
• Scheduling with Finite Capacity Input Buffers
• DNA Sequencing—Tabu and Scatter Search Combined
• Flowshop sequencing problems with limited buffer storage
• An Adaptable Scheduling Algorithm for Flexible Flow Lines
• Tabu Search—Part I
• Scheduling flexible flow lines with no in-process buffers
• Lagrangian relaxation algorithms for real-time hybrid flowshop scheduling with finite intermediate buffers