Two metaheuristic methods for the common cycle economic lot sizing and scheduling in flexible flow shops with limited intermediate buffers: the finite horizon case
From MaRDI portal
Publication:864823
DOI10.1016/j.amc.2006.05.106zbMath1127.90348MaRDI QIDQ864823
Publication date: 13 February 2007
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.05.106
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
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
Cites Work
- Unnamed Item
- Unnamed Item
- Cyclic scheduling to minimize inventory in a batch flow line
- An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers.
- 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
- Heuristics for scheduling in a flow shop with multiple processors
- A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains
- Computing Optimal Lot Sizes in the Economic Lot Scheduling Problem
- Sequencing, lot sizing and scheduling of several products in job shops: The common cycle approach
- Common Cycle Lot-Size Scheduling for Multi-Product, Multi-Stage Production
- The impact of sequencing decisions on multi-item lot sizing and scheduling in flow shops
- Hybrid genetic algorithm for the economic lot-scheduling problem
- On the General Feasibility Test of Scheduling Lot Sizes for Several Products on One Machine
- The two-group heuristic to solve the multi-product, economic lot sizing and scheduling problem in flow shops.
