Bottleneck-based heuristics to minimize tardy jobs in a flexible flow line with unrelated parallel machines
From MaRDI portal
Publication:3605446
DOI10.1080/00207540701352102zbMath1154.90358OpenAlexW2054602309MaRDI QIDQ3605446
Chun-Lung Chen, Chuen-Lung S. Chen
Publication date: 24 February 2009
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540701352102
Related Items (2)
The hybrid flow shop scheduling problem ⋮ A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines
Cites Work
- Global lower bounds for flow shops with multiple processors
- An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers.
- A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation
- Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines
- A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
- A comparison of sequencing rules in static and dynamic hybrid flow systems
- Bottleneck-focused scheduling for a hybrid flowshop
- A dispatching rule-based approach to production scheduling in a printed circuit board manufacturing system
- Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study
- Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- A flexible flowshop problem with total flow time minimization
This page was built for publication: Bottleneck-based heuristics to minimize tardy jobs in a flexible flow line with unrelated parallel machines
