Worst-case analysis for flow shop scheduling problems with an exponential learning effect

@article{Wang2012WorstcaseAF,
  title={Worst-case analysis for flow shop scheduling problems with an exponential learning effect},
  author={J.-B. Wang and M.-Z. Wang},
  journal={JORS},
  year={2012},
  volume={63},
  pages={130-137}
}
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… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 15 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 31 references

Scheduling: Theory, Algorithms and Systems

  • M Pinedo
  • Prentice Hall: Englewood Cliffs, NJ.
  • 2002
Highly Influential
4 Excerpts

The single machine problem with quadratic penalty function of completion times: A branch-and-bound solution

  • W Townsend
  • Mngt Sci 24: 530–534.
  • 1978
Highly Influential
4 Excerpts

Algorithms with performance guarantees for flow shops with regular objective functions

  • C Koulamas, GJ Kyparisis
  • IIE Trans 37: 1107–1111.
  • 2005
Highly Influential
4 Excerpts

Various optimizers for single-stage production

  • WE Smith
  • Nav Res Log 3: 59–66.
  • 1956
Highly Influential
4 Excerpts

Worst-case analysis for flow shop scheduling with a learning effect

  • Z Xu, L Sun, J Gong
  • Int J Prod Econ 113: 748–753. Received July 2009…
  • 2008
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…