Scheduling flexible flow lines with no in-process buffers

DOI10.1080/00207549508930214zbMATH Open0916.90156OpenAlexW2027035110MaRDI QIDQ4398979FDOQ4398979

Authors: 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

Recommendations

• An Adaptable Scheduling Algorithm for Flexible Flow Lines
• Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers
• scientific article; zbMATH DE number 1998826
• Formulations and heuristics for scheduling in a buffer-constrained flowshop and flowline-based manufacturing cell with different buffer-space requirements for jobs: Part 2
• An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers.

zbMATH Keywords

heuristicflexible flow lineno intermediate buffers

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (16)

• Scheduling a dynamic flexible flow line with sequence-dependent setup times: a simulation analysis
• An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times
• An Adaptable Scheduling Algorithm for Flexible Flow Lines
• Scheduling a two stage proportionate flexible flow shop with dedicated machines and no buffers
• An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers.
• A taxonomy of flexible flow line scheduling procedures
• The hybrid flow shop scheduling problem
• A memetic algorithm for the flexible flow line scheduling problem with processor blocking
• Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
• The interface of buffer design and cyclic scheduling decisions in deterministic flow lines
• A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers
• Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems
• Title not available (Why is that?)
• A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities.
• Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers
• Scheduling flexible flow lines with sequence-dependent setup times

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

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