Journal
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
Volume 63, Issue 1, Pages 130-137Publisher
PALGRAVE MACMILLAN LTD
DOI: 10.1057/jors.2011.40
Keywords
scheduling; flow shop; learning effect; worst-case analysis
Funding
- National Natural Science Foundation of China [11001181, 71031002]
- National Natural Science Foundation of China for Distinguished Young Scholars [70725004]
Ask authors/readers for more resources
A real industrial production phenomenon, referred to as learning effects, has drawn increasing attention. However, most research on this issue considers only single machine problems. Motivated by this limitation, this paper considers flow shop scheduling problems with an exponential learning effect. By the exponential learning effect, we mean that the processing time of a job is defined by an exponent function of its position in a processing permutation. The objective is to minimize one of the four regular performance criteria, namely, the total completion time, the total weighted completion time, the discounted total weighted completion time, and the sum of the quadratic job completion times. We present heuristic algorithms by using the optimal permutations for the corresponding single-machine scheduling problems. We also analyse the worst-case bound of our heuristic algorithms. Journal of the Operational Research Society (2012) 63, 130-137. doi:10.1057/jors.2011.40 Published online 1 June 2011
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available