An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops
DOI10.1016/j.tcs.2017.09.018zbMath1393.68041OpenAlexW2760545295MaRDI QIDQ2636494
Weitian Tong, Randy Goebel, Eiji Miyano, Guo-Hui Lin
Publication date: 5 June 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.09.018
multiprocessor schedulingmakespanlinear programpolynomial-time approximation schemeflow-shop scheduling
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for the parallel flow shop problem
- An FPTAS for the parallel two-stage flowshop problem
- A new polynomial-time algorithm for linear programming
- Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
- Approximability of flow shop scheduling
- Minimizing makespan in hybrid flowshops
- Scheduling a two-stage hybrid flow shop with parallel machines at the first stage
- A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
- The hybrid flow shop scheduling problem
- Optimal two- and three-stage production schedules with setup times included
- Two-Stage, Hybrid Flowshop Scheduling Problem
- Algorithms for Scheduling Independent Tasks
- Flowshop and Jobshop Schedules: Complexity and Approximation
- The Complexity of Flowshop and Jobshop Scheduling
- A New Heuristic for Three-Machine Flow Shop Scheduling
- Short Shop Schedules
- Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage
- Bounds for Certain Multiprocessing Anomalies
This page was built for publication: An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops
