Permutation flowshop scheduling with simple linear deterioration

作     者：Sun, Lin-Hui Ge, Chen-Chen Zhang, Wei Wang, Ji-Bo Lu, Yuan-Yuan 

作者机构：Xian Univ Sci & Technol Sch Management Xian Shaanxi Peoples R China Xian Univ Sci & Technol Sch Management Lean Prod & Human Engn Res Ctr Xian Shaanxi Peoples R China Shenyang Aerosp Univ Sch Sci Shenyang Liaoning Peoples R China Jilin Normal Univ Coll Math Siping Peoples R China 

出 版 物：《ENGINEERING OPTIMIZATION》 (工程优选)

年 卷 期：2019年第51卷第8期

页      面：1281-1300页

核心收录：

学科分类：1201[管理学-管理科学与工程(可授管理学、工学学位)] 08[工学] 

基　　金：National Science Foundation of China [71673220, 71471120, 71501082] Support Program for Innovative Talents in Liaoning University of China [LR2016017] Liaoning BaiQianWan Talents Program of China 

主　　题：Scheduling deteriorating job flowshop worst-case bound approximation algorithm 

摘      要：This article addresses permutation flowshop scheduling problems with simple linear deterioration. The objectives are to minimize logarithm of the makespan, total logarithm of the completion time, total weighted logarithm of the completion time, and the sum of the quadratic job logarithms of the completion times. Approximation algorithms and their worst-case bounds are presented and analysed. Branch-and-bound algorithms are also proposed to solve the problems optimally. Computational experiments are performed to illustrate the algorithms.