Advertisement

Scheduling Jobs with Sequence Dependent Setups on Coupled Lines

  • E. C. Sewell
  • J. C. Tan
Part of the Applied Optimization book series (APOP, volume 16)

Abstract

This paper introduces the problem of scheduling a set of jobs with sequence dependent setup times on a machine with a pair of coupled processing lines, i.e., both lines must be operated simultaneously. A heuristic procedure is developed to find a good schedule which then is used as a starting point for a tabu search. A mixed integer programming formulation of the problem is also given. Computational results on real-world problems are presented.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    J. W. Barnes and M. Laguna, 1993, A tabu search experience in production scheduling, Annals of Operations Research, 41, 141–156.CrossRefGoogle Scholar
  2. [2]
    T. C. E. Cheng and C. C. S. Sin, 1990, A state-of-the-art review of parallel-machine scheduling, European Journal of Operations Research, 47, 27 1292.Google Scholar
  3. [3]
    F. Glover, 1989, Tabu search, part i, ORSA Journal on Computing, 1, 190–206.CrossRefGoogle Scholar
  4. [4]
    F. Glover, 1990a, Tabu search–part ii, ORSA Journal on Computing, 2, 4–32.CrossRefGoogle Scholar
  5. [5]
    F. Glover, 1990b, Tabu search: a tutorial, Interfaces, 20, 74–94.CrossRefGoogle Scholar
  6. [6]
    F. Glover, 1995, Tabu search fundamentals and uses, Technical report, University of Colorado.Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 1998

Authors and Affiliations

  • E. C. Sewell
    • 1
  • J. C. Tan
    • 2
  1. 1.Department of Mathematics and StatisticsSouthern Illinois University at EdwardsvilleEdwardsvilleUSA
  2. 2.Department of SystemsUniversity of PennsylvaniaPennsylvaniaUSA

Personalised recommendations