A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops

DOI10.1016/j.ejor.2019.08.019zbMath1430.90257OpenAlexW2968174209MaRDI QIDQ2329473

Taibo Luo, Ruyan Jin, Weitian Tong, Jianming Dong

Publication date: 17 October 2019

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2019.08.019

zbMATH Keywords

schedulingmakespanpolynomial-time approximation schememixed integer programparallel two-stage flow-shops

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Scheduling multiple two-stage flowshops with a deadline ⋮ Scheduling on multiple two-stage flowshops with a deadline ⋮ A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint ⋮ On scheduling multiple parallel two-stage flowshops with Johnson's rule

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
• 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
• Approximation algorithms on multiple two-stage flowshops
• The hybrid flow shop scheduling problem
• 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 setup times included
• Integer Programming with a Fixed Number of Variables
• Two-Stage, Hybrid Flowshop Scheduling Problem
• Algorithms for Scheduling Independent Tasks
• The Complexity of Flowshop and Jobshop Scheduling
• Short Shop Schedules
• On Approximation Algorithms for Two-Stage Scheduling Problems
• 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: A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops