Skip to main content
SpringerLink
Log in

A Hybrid Dual-Population Genetic Algorithm for the Single Machine Maximum Lateness Problem

  • Conference paper
Evolutionary Computation in Combinatorial Optimization (EvoCOP 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6622))

Abstract

We consider the problem of scheduling a number of jobs, each job having a release time, a processing time and a due date, on a single machine with the objective of minimizing the maximum lateness. We developed a hybrid dual-population genetic algorithm and compared its performance with alternative methods on a new diverse data set. Extensions from a single to a dual population by taking problem specific characteristics into account can be seen as a stimulator to add diversity in the search process, which has a positive influence on the important balance between intensification and diversification. Based on a comprehensive literature study on genetic algorithms in single machine scheduling, a fair comparison of genetic operators was made.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Campos, V., Laguna, M., Marti, R.: Context-independent scatter and tabu search for permutation problems. Journal on Computing 17, 111–122 (2005)

    MathSciNet  MATH  Google Scholar 

  2. Carlier, J.: The one-machine sequencing problem. European Journal of Operational Research 11, 42–47 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  3. Chang, P.-C., Su, L.-H.: Scheduling n jobs on one machine to minimize the maximum lateness with a minimum number of tardy jobs. Computers & Industrial Engineering 40, 349–360 (2001)

    Article  Google Scholar 

  4. Glover, F.: A template for scatter search and path relinking. In: Hao, J.-K., Lutton, E., Ronald, E., Schoenauer, M., Snyers, D. (eds.) AE 1997. LNCS, vol. 1363, pp. 13–54. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  5. Gordon, V.S., Proth, J.-M., Chu, C.: Due date assignment and scheduling: SLK, TWK and other due date assignment models. Production Planning & Control 13(2), 117–132 (2002)

    Article  Google Scholar 

  6. Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy-Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics 5, 287–326 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  7. Hariri, A.M.A., Potts, C.N.: Single machine scheduling with batch set-up times to minimize maximum lateness. Annals of Operations Research 70, 75–92 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  8. Holland, J.: Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor (1975)

    Google Scholar 

  9. Jackson, J.R.: Scheduling a production line to minimize maximum tardiness. Management Science Research Report 43, University of California, Los Angeles (1955)

    Google Scholar 

  10. Lenstra, J.K., Rinnooy-Kan, A.H.G., Brucker, P.: Complexity of machine scheduling problems. Annals of Discrete Mathematics 1, 343–362 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  11. McMahon, G., Florian, M.: On scheduling with ready times and due dates to minimize maximum lateness. Operations Research 23, 475–482 (1975)

    Article  MATH  Google Scholar 

  12. Michiels, W., Aarts, E., Korst, J.: Theoretical Aspects of Local Search Series. In: Monographs in Theoretical Computer Science, An EATCS Series (2007)

    Google Scholar 

  13. Pan, Y., Shi, L.: Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem. European Journal of Operational Research 168, 1030–1039 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  14. Potts, C.N., Van Wassenhove, L.N.: A branch and bound algorithm for the total weighted tardiness problem. Operations Research 33(2), 363–377 (1985)

    Article  MATH  Google Scholar 

  15. Sels, V., Vanhoucke, M.: A genetic algorithm for the single machine maximum lateness problem. Technical report, Ghent University (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Economics and Business Administration, Ghent University, Tweekerkenstraat 2, 9000, Gent, Belgium

    Veronique Sels & Mario Vanhoucke

  2. Operations and Technology Management Centre, Vlerick Leuven Gent Management School, Reep 1, 9000, Gent, Belgium

    Mario Vanhoucke

Authors
  1. Veronique Sels
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mario Vanhoucke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Business Administration and Computer Science, University of Applied Sciences and Arts, Ricklinger Stadtweg 120, 30459, Hannover, Germany

    Peter Merz

  2. Faculty of Sciences, University of Angers, 2, Boulevard Lavoisier, Cedex 01, 49045, Angers, France

    Jin-Kao Hao

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sels, V., Vanhoucke, M. (2011). A Hybrid Dual-Population Genetic Algorithm for the Single Machine Maximum Lateness Problem. In: Merz, P., Hao, JK. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2011. Lecture Notes in Computer Science, vol 6622. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20364-0_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20364-0_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20363-3

  • Online ISBN: 978-3-642-20364-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation