A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint

DOI10.1016/j.tcs.2022.04.044OpenAlexW4224981819WikidataQ114129111 ScholiaQ114129111MaRDI QIDQ2672605

Hui-Li Zhang, Yao Xu, Weitian Tong

Publication date: 13 June 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2201.04196

zbMATH Keywords

polynomial-time approximation schemeroundingmakespan constraintmultiple knapsacksparallel two-stage flowshops

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items

On scheduling multiple parallel two-stage flowshops with Johnson's rule

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation algorithms for the parallel flow shop problem
• An FPTAS for the parallel two-stage flowshop problem
• Interior-point methods
• On scheduling multiple two-stage flowshops
• Scheduling on multiple two-stage flowshops with a deadline
• Improved approximation algorithms for two-stage flowshops scheduling problem
• On scheduling inclined jobs on multiple two-stage flowshops
• A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops
• Scheduling two-stage jobs on multiple flowshops
• Scheduling a two-stage flowshop under makespan constraint
• 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
• A Fast Approximation Scheme for the Multiple Knapsack Problem
• Iterative Methods in Combinatorial Optimization
• Parameterized Approximation Scheme for the Multiple Knapsack Problem
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
• On stirling numbers of the second kind
• Handbook on Scheduling