Worst-case analysis for flow shop scheduling problems with an exponential learning effect
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.
Year of publication: |
2012
|
---|---|
Authors: | Wang, J-B ; Wang, M-Z |
Published in: |
Journal of the Operational Research Society. - Palgrave Macmillan, ISSN 0160-5682. - Vol. 63.2012, 1, p. 130-137
|
Publisher: |
Palgrave Macmillan |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Worst-case analysis for flow shop scheduling problems with an exponential learning effect
Wang, J-B, (2012)
-
Parallel machines scheduling with a deteriorating maintenance activity
Wang, J-J, (2011)
-
Single-machine scheduling with a sum-of-actual-processing-time-based learning effect
Wang, J-B, (2010)
- More ...