Conceptual framework for lot-sizing and scheduling of flexible flow lines
From MaRDI portal
Publication:5466729
DOI10.1080/00207540500066762zbMath1068.90063OpenAlexW1972027888MaRDI QIDQ5466729
Publication date: 25 August 2005
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540500066762
Related Items
Simultaneous lotsizing and scheduling problems: a classification and review of models, Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times, Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective, A taxonomy of flexible flow line scheduling procedures, Two hybrid meta-heuristics for the finite horizon ELSP in flexible flow lines with unrelated parallel machines, Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover, Multi‐level, multi‐stage lot‐sizing and scheduling in the flexible flow shop with demand information updating, Batch-size-based rearrangement of the shop floor into mini-lines, Control methods for dynamic time-based manufacturing under customized product lead times, Capacitated lot-sizing with extensions: a review, Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic, Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over
Cites Work
- Branch and bound algorithm for the flow shop with multiple processors
- Capacitated lot-sizing with extensions: a review
- A multi-stage parallel-processor flowshop problem with minimum flowtime
- Lot sizing and scheduling -- survey and extensions
- Branch and bound crossed with GA to solve hybrid flowshops
- Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions
- A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities.
- Heuristics for hybrid flow shops with controllable processing times and assignable due dates
- The flow shop with parallel machines: A tabu search approach
- A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
- Heuristics for scheduling in a flow shop with multiple processors
- Scheduling flexible flow lines with sequence-dependent setup times
- Lot-sizing and scheduling for flexible flow lines.
- Capacitated lot-sizing with sequence dependent setup costs
- Optimal two- and three-stage production schedules with setup times included
- Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over
- An Adaptable Scheduling Algorithm for Flexible Flow Lines
- Computational Complexity of the Capacitated Lot Size Problem
- The Complexity of Flowshop and Jobshop Scheduling
- Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
- Simultaneous lot sizing and loading of product families on parallel facilities of different classes
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- A flexible flowshop problem with total flow time minimization
