A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops
A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops
复制标题
并行相同两阶段开放车间调度的完全多项式时间近似方案
DOI:
10.1007/s10878-018-0314-6
复制
发表时间:
2018-06
影响因子:
1
通讯作者:
Guohui Lin
中科院分区:
文献类型:
--
作者:
Jianming Dong;Ruyan Jin;Jueliang Hu;Guohui Lin
A two-stage openshop consists of a machine in the first stage and a machine in the second stage; a job processed on the two-stage openshop means it is processed non-preemptively by each of the two machines, in whichever order. We consider the scheduling problem at the availability of multiple parallel identical two-stage openshops, with the goal to minimize the makespan. By uncovering the important role of thecriticaljob in the optimal schedule on a two-stage openshop, we propose to sort the jobs in the novelcritical-job order, and use this order to design a pseudo-polynomial time dynamic programming exact algorithm to solve our scheduling problem with any fixed number of two-stage openshops. Afterwards, using the standard scaling technique, we develop the dynamic programming algorithm into a fully polynomial-time approximation scheme. These results improve previously proposed constant ratio approximation algorithms.
登录
查看更多内容
DOI:
10.1007/978-0-387-39940-9_3525
发表时间:
2018-09
期刊:
2006 15th IEEE International Conference on High Performance Distributed Computing
影响因子:
--
作者:
Susmita Bandyopadhyay
通讯作者:
Susmita Bandyopadhyay
影响因子:
6.4
作者:
Zhang, Xi;ong;van de Velde, Steef
通讯作者:
van de Velde, Steef
DOI:
10.1016/s0167-6377(99)00005-x
发表时间:
1999-05
期刊:
Oper. Res. Lett.
影响因子:
--
作者:
P. Schuurman;G. Woeginger
通讯作者:
P. Schuurman;G. Woeginger
DOI:
10.1007/978-3-319-39817-4_22
发表时间:
2016-06
期刊:
--
影响因子:
--
作者:
Weitian Tong;Eiji Miyano;R. Goebel;Guohui Lin
通讯作者:
Weitian Tong;Eiji Miyano;R. Goebel;Guohui Lin
DOI:
10.1007/978-1-4613-0303-9_25
发表时间:
1998
期刊:
--
影响因子:
--
作者:
Bo Chen;C. Potts;G. Woeginger
通讯作者:
Bo Chen;C. Potts;G. Woeginger