Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Advertisement

Springer Nature Link
Log in

Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

Local search heuristics are developed for a problem of scheduling a single machine to minimize the total weighted completion time. The jobs are partitioned into families, and a set-up time is necessary when there is a switch in processing jobs from one family to jobs of another family. Four alternative neighbourhood search methods are developed: multi-start descent, simulated annealing, threshold accepting and tabu search. The performance of these heuristics is evaluated on a large set of test problems, and the results are also compared with those obtained by a genetic algorithm. The best results are obtained with the tabu search method for smaller numbers of families and with the genetic algorithm for larger numbers of families. In combination, these methods generate high quality schedules at relatively modest computational expense.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. B.-H. Ahn and J.-H. Hyun, Single facility multi-class job scheduling, Computers and Operations Research 17(1990)265–272.

    Article  Google Scholar 

  2. H.A.J. Crauwels, A.M.A. Hariri, C.N. Potts and L.N. Van Wassenhove, Branch and bound algorithms for single machine scheduling with batch set-up times to minimize total weighted completion time, Annals of Operations Research (1997), to appear.

  3. K.A. Dowsland, Some experiments with simulated annealing techniques for packing problems, European Journal of Operational Research 68(1993)389–399.

    Article  Google Scholar 

  4. G. Dueck and T. Scheuer, Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing, Journal of Computational Physics 90(1990)161–175.

    Article  Google Scholar 

  5. R.W. Eglese, Simulated annealing: A tool for operational research, European Journal of Operational Research 46(1990)271–281.

    Article  Google Scholar 

  6. J.B. Ghosh, Batch scheduling to minimize total completion time, Operations Research Letters 16(1994)271–275.

    Article  Google Scholar 

  7. F. Glover, Tabu search, Part I, ORSA Journal on Computing 1(1989)190–206.

    Google Scholar 

  8. J.N.D. Gupta, Single facility scheduling with multiple job classes, European Journal of Operational Research 8(1988)42–45.

    Article  Google Scholar 

  9. D.S. Johnson, C.R. Aragon, L.A. McGeoch and C. Schevon, Optimization by simulated annealing: An experimental evaluation; part I, graph partitioning, Operations Research, 37(1989)865–892.

    Google Scholar 

  10. A. Kirkpatrick, C.D. Gelatt, Jr. and M.P. Vecchi, Optimization by simulated annealing, Science 220(1983)671–680.

    Google Scholar 

  11. C.K.Y. Lin, K.B. Haley and C. Sparks, A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems, European Journal of Operational Research 83(1995)330–346.

    Article  Google Scholar 

  12. A.J. Mason, Genetic algorithms and scheduling problems, Ph.D. Thesis, Department of Engineering, University of Cambridge, U.K., 1992.

    Google Scholar 

  13. A.J. Mason and E.J. Anderson, Minimizing flow time on a single machine with job classes and setup times, Naval Research Logistics 38(1991)333–350.

    Google Scholar 

  14. C.L. Monma and C.N. Potts, On the complexity of scheduling with batch setup times, Operations Research 37(1989)798–804.

    Article  Google Scholar 

  15. M. Pirlot, General local search heuristics in combinatorial optimization: A tutorial, Belgian Journal of Operations Research, Statistics and Computer Science, 32(1992)8–67.

    Google Scholar 

  16. C.N. Potts, Scheduling two job classes on a single machine, Computers and Operations Research 18(1991)411–415.

    Article  Google Scholar 

  17. C.N. Potts and L.N. Van Wassenhove, Single machine tardiness sequencing heuristics, IIE Transactions 23(1991)346–354.

    Google Scholar 

  18. C.N. Potts and L.N. Van Wassenhove, Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity, Journal of the Operational Research Society 43(1992)395–406.

    Article  Google Scholar 

  19. W.E. Smith, Various optimizers for single-stage production, Naval Research Logistics Quarterly 3(1956)59–66.

    Google Scholar 

Download references

Authors
  1. H.A.J. Crauwels
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C.N. Potts
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. L.N. Van Wassenhove
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Crauwels, H., Potts, C. & Van Wassenhove, L. Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time. Annals of Operations Research 70, 261–279 (1997). https://doi.org/10.1023/A:1018978322417

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1018978322417

Search

Navigation