Approximation algorithms for two-stage flexible flow shop scheduling
From MaRDI portal
Publication:2292124
DOI10.1007/s10878-019-00449-3zbMath1447.90014MaRDI QIDQ2292124
Yan Lan, Xin Han, Ming-Hui Zhang
Publication date: 3 February 2020
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-019-00449-3
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68W25: Approximation algorithms
Related Items
Cites Work
- Scheduling multiprocessor tasks -- An overview
- Minimizing makespan in hybrid flowshops
- Heuristics for hybrid flow shops with controllable processing times and assignable due dates
- Two-stage proportionate flexible flow shop to minimize the makespan
- Optimal two- and three-stage production schedules with setup times included
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- Approximation Algorithms for Scheduling Parallel Jobs
- Unnamed Item
- Unnamed Item
- Unnamed Item