A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops
From MaRDI portal
Publication:2420659
DOI10.1007/s10878-018-0314-6zbMath1423.90089OpenAlexW2805549752MaRDI QIDQ2420659
Ruyan Jin, Jianming Dong, Jueliang Hu, Guo-Hui Lin
Publication date: 6 June 2019
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-018-0314-6
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for the parallel flow shop problem
- An FPTAS for the parallel two-stage flowshop problem
- Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
- Approximability of flow shop scheduling
- Makespan minimization in open shops: A polynomial time approximation scheme
- Approximation algorithms for the multiprocessor open shop scheduling problem
- Worst-case analysis of heuristics for open shops with parallel machines
- 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
- Approximation algorithms for parallel open shop scheduling
- The hybrid flow shop scheduling problem
- Corrigendum to: ``An FPTAS for the parallel two-stage flowshop problem
- Optimal two- and three-stage production schedules with setup times included
- Two-Stage, Hybrid Flowshop Scheduling Problem
- Algorithms for Scheduling Independent Tasks
- Open Shop Scheduling to Minimize Finish Time
- 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
- Parallel flowshop scheduling using Tabu search
- A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan
- Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage
- Scheduling
