Title
Flow shop scheduling with general position weighted learning effects to minimise total weighted completion time
Abstract
This article considers the flow shop problem of minimising the total weighted completion time in which the processing times of jobs are variable according to general position weighted learning effects. Two simple heuristics are proposed, and their worst-case error bounds are analysed. In addition, some complex heuristics (including simulated annealing algorithms) and a branch-and-bound algorithm are proposed as solutions to this problem. Finally, computational experiments are performed to examine the effectiveness and efficiency of the proposed algorithms.
Year
DOI
Venue
2021
10.1080/01605682.2020.1806746
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
Keywords
DocType
Volume
Scheduling, simulated annealing, learning effect, flow shop, branch-and-bound algorithm
Journal
72
Issue
ISSN
Citations 
12
0160-5682
0
PageRank 
References 
Authors
0.34
0
3
Name
Order
Citations
PageRank
Xinyu Sun100.34
Xin-Na Geng200.34
Feng Liu301.35