A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops
DOI10.1007/S10479-024-05860-6zbMATH Open1543.90094MaRDI QIDQ6546990
Mingyang Gong, Weitian Tong, Guohui Lin, Eiji Miyano, Bing Su
Publication date: 30 May 2024
Published in: Annals of Operations Research (Search for Journal in Brave)
schedulingmakespanconfigurationpolynomial-time approximation schemeparallel identical multi-stage flow-shops
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximation algorithms for the parallel flow shop problem
- An FPTAS for the parallel two-stage flowshop problem
- Approximability of flow shop scheduling
- A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
- Approximation algorithms on multiple two-stage flowshops
- A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops
- Corrigendum to: ``An FPTAS for the parallel two-stage flowshop problem
- Approximation algorithms for scheduling multiple two-stage flowshops
- An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops
- Optimal two- and three-stage production schedules with set-up time included
- Integer Programming with a Fixed Number of Variables
- Algorithms for Scheduling Independent Tasks
- The Complexity of Flowshop and Jobshop Scheduling
- Short Shop Schedules
- On Approximation Algorithms for Two-Stage Scheduling Problems
- Scheduling
This page was built for publication: A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6546990)
