Research on no-idle permutation flowshop scheduling with time-dependent learning effect and deteriorating jobs

详细信息    查看全文

• 作者：Yuan-Yuan Lu ; ^{luyuanyuan_jilin@163.com" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Scheduling ; No-idle ; Flowshop ; Learning effect ; Deteriorating jobs
• 刊名：Applied Mathematical Modelling
• 出版年：2016
• 出版时间：15 February 2016
• 年：2016
• 卷：40
• 期：4
• 页码：3447-3450
• 全文大小：233 K

文摘

This note considers no-idle permutation flowshop scheduling problems with time-dependent learning effect and deteriorating jobs. The objective functions are to minimize the makespan and the total (weighted) completion time, respectively. Low and Lin [1], showed that an optimal sequence for these problems can be solved in polynomial time. We demonstrate these results to be incorrect by counter-examples for the no-idle permutation flowshop scheduling problems with an increasing series of dominating machines (idm), then introduce new exact solution algorithms that polynomially solve these problems.