Capacity-filtering algorithms for finite-capacity planning of a flexible flow line
From MaRDI portal
Publication:3055437
DOI10.1080/00207540701644201zbMath1198.90173OpenAlexW2059719597MaRDI QIDQ3055437
No author found.
Publication date: 7 November 2010
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540701644201
flexible flow linecapacity filteringfinite capacity planningliquid crystal display (LCD) and semiconductor fabrication (Fab)time bucketing
Cites Work
- A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities.
- 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
- Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
- Order-release planning using variable lead times based on a backward simulation model
- Finite-capacity production planning algorithms for a semiconductor wafer fabrication facility
- A new and practical heuristic for Master Production Scheduling creation
