.png){kind=icon}
Return
Flowshop scheduling with a general exponential learning effect
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2013.09.001.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper investigates flowshop scheduling problems with a general exponential learning effect, i.e., the actual processing time of a job is defined by an exponent function of the total weighted normal processing time of the already processed jobs and its position in a sequence, where the weight is a position-dependent weight. The objective is to minimize the malcespan, the total (weighted) completion time, the total weighted discounted completion time, and the sum of the quadratic job completion times, respectively. Several simple heuristic algorithms are proposed in this paper by using the optimal schedules for the corresponding single machine problems. The tight worst-case bound of these heuristic algorithms is also given. Two well-known heuristics are also proposed for the flowshop scheduling with a general exponential learning effect. (C) 2013 Published by Elsevier Ltd.
Keywords:
Scheduling
Flowshop
Learning effect
Heuristic algorithm
Worst-case analysis
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
Cited Papers
ShareSaveLipid Droplet Accumulation Independently Predicts Poor Clinical Prognosis in High-Grade Serous Ovarian Carcinoma.png)
Cancers
OAAI
CancersIF0
OAAIShareSaveShareSaveThird-order exceptional point and successive switching among three states in an optical microcavity
OAAI
OAAIShareSave
View more