FPTAS for the two identical parallel machine problem with a single operator under the free changing mode
详细信息 查看全文
- 作者：Pierre Baptistea ; pierre.baptiste@polymtl.ca" class="auth_mail" title="E-mail the corresponding author ; Djamal Rebaine ; b ; Djamal_Rebaine@uqac.ca" class="auth_mail" title="E-mail the corresponding author ; Mohammed Zoubaa ; mohammed.zouba@polymtl.ca" class="auth_mail" title="E-mail the corresponding author
- 关键词：FPTAS ; Free changing mode ; Identical parallel machines ; Operator
- 刊名：European Journal of Operational Research
- 出版年：2017
- 出版时间：1 January 2017
- 年：2017
- 卷：256
- 期：1
- 页码：55-61
- 全文大小：560 K
文摘
- •
Schedule a set of jobs on two identical parallel machines with a single operator.
- •
The way the operator supervises the machines may change over time.
- •
The corresponding decision problem is NP- hard in the ordinary sense.
- •
Exhibition of a pseudo-polynomial time algorithm to find an optimal schedule.
- •
Exhibition of a fully polynomial time approximation scheme.