An FPTAS for the parallel two-stage flowshop problem

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 prob...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 657; pp. 64 - 72
Main Authors:	Dong, Jianming, Tong, Weitian, Luo, Taibo, Wang, Xueshi, Hu, Jueliang, Xu, Yinfeng, Lin, Guohui
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 02.01.2017
Subjects:	Dynamic programming Fully polynomial-time approximation scheme Makespan Multiprocessor scheduling Two-stage flowshop scheduling Multiprocessor scheduling Fully polynomial-time approximation scheme Makespan Dynamic programming Two-stage flowshop scheduling
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!