Corrigendum to: ``An FPTAS for the parallel two-stage flowshop problem

DOI10.1016/j.tcs.2017.05.016zbMath1371.68044OpenAlexW2619621338MaRDI QIDQ2357384

Mikhail Y. Kovalyov, Weitian Tong, Jianming Dong, Taibo Luo, Jueliang Hu, Xueshi Wang, Yin-Feng Xu, Guo-Hui Lin

Publication date: 13 June 2017

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.05.016

zbMATH Keywords

dynamic programmingmultiprocessor schedulingmakespanfully polynomial-time approximation schemetwo-stage flowshop scheduling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (7)

An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem ⋮ Scheduling two-stage jobs on multiple flowshops ⋮ A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops ⋮ Maximizing total early work in a distributed two‐machine flow‐shop ⋮ On scheduling multiple parallel two-stage flowshops with Johnson's rule ⋮ On scheduling inclined jobs on multiple two-stage flowshops ⋮ A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops

Cites Work

• Approximation algorithms for the parallel flow shop problem
• An FPTAS for the parallel two-stage flowshop problem

This page was built for publication: Corrigendum to: ``An FPTAS for the parallel two-stage flowshop problem