Permutation flowshop scheduling with simple linear deterioration

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 comp...

Full description

Saved in:
Bibliographic Details
Published in:Engineering optimization 2019-08, Vol.51 (8), p.1281-1300
Main Authors: Sun, Lin-Hui, Ge, Chen-Chen, Zhang, Wei, Wang, Ji-Bo, Lu, Yuan-Yuan
Format: Article
Language:English
Subjects:
Algorithms
approximation algorithm
Completion time
deteriorating job
Deterioration
flowshop
Job shops
Logarithms
Permutations
Production scheduling
Scheduling
worst-case bound
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0305-215X
1029-0273
DOI:10.1080/0305215X.2018.1519558