Scheduling flexible flow lines with no in-process buffers

DOI10.1080/00207549508930214zbMath0916.90156OpenAlexW2027035110MaRDI QIDQ4398979

Tadeusz J. Sawik

Publication date: 30 June 1999

Published in: International Journal of Production Research (Search for Journal in Brave)

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

zbMATH Keywords

heuristicflexible flow lineno intermediate buffers

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items (11)

Scheduling flexible flow lines with sequence-dependent setup times ⋮ Scheduling a dynamic flexible flow line with sequence-dependent setup times: a simulation analysis ⋮ Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective ⋮ An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times ⋮ A taxonomy of flexible flow line scheduling procedures ⋮ A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities. ⋮ A memetic algorithm for the flexible flow line scheduling problem with processor blocking ⋮ A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers ⋮ Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems ⋮ The hybrid flow shop scheduling problem ⋮ Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers

Cites Work

• Scheduling algorithms for flexible flowshops: Worst and average case performance
• Branch and bound algorithm for the flow shop with multiple processors
• Scheduling with Deadlines and Loss Functions
• Flowshop sequencing problems with limited buffer storage
• An Adaptable Scheduling Algorithm for Flexible Flow Lines
• Sequencing Two-Machine Flow-Shops with Finite Intermediate Storage

This page was built for publication: Scheduling flexible flow lines with no in-process buffers