Permutation flowshop scheduling with simple linear deterioration. Issue 8 (3rd August 2019)

• Record Type: Journal Article
• Authors: Sun, Lin-Hui; Ge, Chen-Chen; Zhang, Wei; Wang, Ji-Bo; Lu, Yuan-Yuan
• Is Part Of: Engineering optimization. Volume 51:Issue 8(2019)
• Page Start: 1281
• Page End: 1300
• Publication Date: 2019-08-03
• Subjects: Scheduling -- deteriorating job -- flowshop -- worst-case bound -- approximation algorithm; Engineering design -- Periodicals; Mathematical optimization -- Periodicals; 620.0042
• DOI: 10.1080/0305215X.2018.1519558
• Languages: English
• ISSNs: 0305-215X

Abstract

ABSTRACT: 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.