Advertisement

Journal of Intelligent Manufacturing

, Volume 2, Issue 2, pp 63–73 | Cite as

Tabu search methods for a single machine scheduling problem

  • Manuel Laguna
  • J. Wesley Barnes
  • Fred W. Glover
Papers

Abstract

In this paper we discuss the use of three local search strategies within a tabu search (TS) method for the approximate solution of a single machine scheduling problem. The problem consists of minimizing the sum of the set-up costs and linear delay penalties whenN jobs, arriving at time zero, are to be scheduled for sequential processing on a continuously available machine. Following a review of a previous study of this problem, we first consider a TS method that uses the common approach of making a succession of pairwise job exchanges, or swaps, to move from one trial solution to another. Next, we consider the use of insert moves to define the local neighborhood of each trial solution. These moves consist of transferring a single job from one position to another in the schedule. Finally, we construct a TS method (TS-hybrid) that employs both swap and insert moves. Experiments with benchmark problems of up to 60 jobs illustrate that there is an advantage in using more than one strategy to move from one trial solution to another within a TS method.

Keywords

Approximate Solution Local Search Search Strategy Search Method Tabu Search 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barnes, J. W. and Vanston, L. K. (1981) Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs.Operations Research,29.Google Scholar
  2. de Werra, D. and Hertz, A. (1989) Tabu Search Techniques: A Tutorial and an Application to Neural Networks.OR Spectrum,11, 131–41.Google Scholar
  3. Elmaghraby, S. E. and Park, S. H. (1974) Scheduling Jobs on a Number of Identical Machines.AIIE Transactions,16, 1–13.Google Scholar
  4. Feo, T. A. and Resende, M. G. C. A Probabilistic Heuristic for a Computationally Difficult Set Covering Problem.Technical Report Series, Graduate Program in Operations Research, The University of Texas at Austin, USA.Google Scholar
  5. Glover, F. (1989) Tabu Search—Part I.ORSA Journal on Computing,1, 190–206.Google Scholar
  6. Glover, F. (1990) Tabu Search—Part II.ORSA Journal on Computing,2, 4–32.Google Scholar
  7. Glover, F. and Greenberg, H. J. (1989)Target Analysis, Center for Applied Artificial Intelligence, The University of Colorado at Boulder, USA.Google Scholar
  8. Hertz, A. and de Werra, D. (1987) Using Tabu Search Techniques for Graph Coloring.Computing,29, 345–51.Google Scholar
  9. Laguana, M., Barnes, J. W. and Glover, F. (1989) Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs and Times Using Tabu Search.Technical Report Series, Graduate Program in Operations Research, The University of Texas at Austin, USA.Google Scholar
  10. Malek, M., Guruswamy, M., Owens, H. and Pandya, M. (1989) Serial and Parallel Search Techniques for Traveling Salesman Problem.Annals of OR: Linkages with Artificial Intelligence.Google Scholar
  11. Morin, T. L. and Marsten, R. F. (1976) Branch- and Bound-Strategies for Dynamic Programming.Operations Research,24, 611–27.Google Scholar
  12. Vanston, L. K. (1977) Scheduling N Jobs with Setup Charge Dependencies and Linear Delay Penalties.Report no. UT 77-2.Google Scholar

Copyright information

© Chapman and Hall Ltd. 1991

Authors and Affiliations

  • Manuel Laguna
    • 1
  • J. Wesley Barnes
    • 1
  • Fred W. Glover
    • 2
  1. 1.Graduate Program in Operations Research, Department of Mechanical EngineeringThe University of Texas at AustinUSA
  2. 2.US West Chair in Systems Science, Center for Applied Artificial Intelligence, Graduate School of BusinessUniversity of Colorado at BoulderUSA

Personalised recommendations