An FPTAS for the Parallel Two-Stage Flowshop Problem

Authors

• Jianming Dong, Zhejiang Sci-Tech UniversityFollow
• Weitian Tong, Georgia Southern UniversityFollow
• Taibo Luo, Sichuan UniversityFollow
• Xueshi Wang, Zhejiang Sci-Tech University
• Jueliang Hu, Zhejiang UniversityFollow
• Yinfeng Xu, Sichuan UniversityFollow
• Guohui Lin, University of AlbertaFollow

Document Type

Article

Publication Date

1-2-2017

Publication Title

Theoretical Computer Science

DOI

10.1016/j.tcs.2016.04.046

ISSN

0304-3975

Abstract

We consider the NP-hard m-parallel two-stage flowshop problem, abbreviated as the (m, 2)-PFS problem, where we need to schedule n jobs to m parallel identical two-stage flowshops in order to minimize the makespan, i.e. the maximum completion time of all the jobs on the m flowshops. The (m, 2)-PFS problem can be decomposed into two subproblems: to assign the n jobs to the m parallel flowshops, and for each flowshop to schedule the jobs assigned to the flowshop. We first present a pseudo-polynomial time dynamic programming algorithm to solve the (m, 2)-PFS problem optimally, for any fixed m, based on an earlier idea for solving the (2, 2)-PFS problem. Using the dynamic programming algorithm as a subroutine, we design a fully polynomial-time approximation scheme (FPTAS) for the (m, 2)-PFS problem.

Recommended Citation

Dong, Jianming, Weitian Tong, Taibo Luo, Xueshi Wang, Jueliang Hu, Yinfeng Xu, Guohui Lin. 2017. "An FPTAS for the Parallel Two-Stage Flowshop Problem." Theoretical Computer Science, 657 (A): 64-72. doi: 10.1016/j.tcs.2016.04.046
https://digitalcommons.georgiasouthern.edu/compsci-facpubs/60

Copyright

This work is archived and distributed under the repository's Standard Copyright and Reuse License (opens in new tab). End users may copy, store, and distribute this work without restriction. For all other uses, permission must be obtained from the copyright owners or their authorized agents.