Skip to main content
SpringerLink
Log in
Book cover

Proceedings of the 36th International MATADOR Conference pp 119–122Cite as

A cutting plane algorithm for solving single machine scheduling problems with uncertain sequence-dependent setup times

  • Conference paper

  • 3189 Accesses

Abstract

In this paper, a variant of the single machine scheduling problem is considered in which the sequence-dependent setup times are assumed to be uncertain and they can take any real value from a closed interval. For tackling the problem, a mathematical model based on the robust traveling salesman problem is proposed for minimizing the makespan. Then, the proposed model is solved via a cutting plane algorithm. Finally, the computational experiments show the effectiveness of the proposed algorithm in comparison with a commercial optimization software generic branch & bound.

This is a preview of subscription content, 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   259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Pinedo M, (2008) Scheduling - Theory, Algorithms, and Systems, Springer, New York, NY

    MATH  Google Scholar 

  2. Tasgetiren MF, Pan QK, Liang YC, (2009) A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times. Computers and Operations Research, 36:1900-1915

    Article  MATH  Google Scholar 

  3. Bahalke U, Yolmeh AM, Shahanaghi K, Meta-heuristics to solve single-machine scheduling problem with sequencedependent setup time and deteriorating jobs. International Journal of Advanced Manufacturing Technology, In Press, DOI:10.1007/s00170-010-2526-5

    Google Scholar 

  4. Chen WJ, (2008) Sequencing heuristic for scheduling jobs with dependent setups in a manufacturing system. International Journal of Advanced Manufacturing Technology, 38:176-184

    Article  Google Scholar 

  5. Kovács A, Brown KN, Tarim SA, (2009) An efficient MIP model for the capacitated lot-sizing and scheduling problem with sequence-dependent setups. International Journal of Production Economics, 118:282-291

    Article  Google Scholar 

  6. Biskup D, Herrmann J, (2008) Single-machine scheduling against due dates with past-sequence-dependent setup times. European Journal of Operational Research, 191:586-591

    Article  MathSciNet  Google Scholar 

  7. Koulamas C, and Kyparisis GJ, (2008) Single-machine scheduling problems with past-sequence-dependent setup times. European Journal of Operational Research, 187: 1045-1049

    Article  MATH  MathSciNet  Google Scholar 

  8. Wang JB, Jiang Y, Wang G, (2009) Single-machine scheduling with past-sequence-dependent setup times and effects of deterioration and learning. International Journal of Advanced Manufacturing Technology, 41:1221-1226

    Article  Google Scholar 

  9. Yin N, Wang JB, Wang D, Wang LY, Wang XY, (2010) Deteriorating jobs and learning effects on a single-machine scheduling with past-sequence-dependent setup times. International Journal of Advanced Manufacturing Technology, 46:707-714

    Article  MathSciNet  Google Scholar 

  10. Wu CW, Brown KN, Beck JC, (2009) Scheduling with uncertain durations: Modeling β-robust scheduling with constraints. Computers & Operations Research, 36:2348-2356

    Article  MATH  MathSciNet  Google Scholar 

  11. Leus R, Herroelen W, (2007) Scheduling for stability in single-machine production systems. Journal of Scheduling, 10:223-235

    Article  MATH  MathSciNet  Google Scholar 

  12. Ben-Tal A, El Ghaoui L, Nemirovski A, (2009) Robust Optimization. Princeton University Press, Princeton, NJ

    MATH  Google Scholar 

  13. Montemanni R, Barta J., Mastrolilli M., Gambardella L.M., (2007) Heuristic algorithms for the robust traveling salesman problem with interval data. in Proceedings of TRISTAN VI - The Sixth Triennial Symposium on Transportation Analysis, Phuket, Thailand

    Google Scholar 

  14. Montemanni R, Barta J, Mastrolilli M, Gambardella LM, (2007) The robust traveling salesman problem with interval data. Transportation Science, 41:366-381

    Article  Google Scholar 

  15. Bertsimas D, Sim M, (2004) The price of robustness. Operations Research, 52:35-53

    Article  MATH  MathSciNet  Google Scholar 

  16. Dantzig GB, Fulkerson DR, Johnson SM, (1954) Solution of a large scale traveling salesman problem. Operations Research, 2:393-410

    Article  MathSciNet  Google Scholar 

  17. Applegate D, Bixby R, Chvatal V, Cook W, (2003) Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems. Mathematical Programming, 97:91-153

    MATH  MathSciNet  Google Scholar 

  18. Reinelt G, (2010) TSPLIB. Availble from www.iwr.uniheidelberg.de/groups/comopt/software/TSPLIB95/

    Google Scholar 

  19. Luo X, Chu F, (2006) A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness. Applied Mathematics and Computation, 183:575-588

    Article  MATH  MathSciNet  Google Scholar 

  20. Miller CE, Tucker AW, Zemlin RA, (1960) Integer programming formulations and traveling salesman problems. Journal of the ACM, 7:326-329

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Faculty of Engineering, Tarbiat Modares University, Tehran, Iran, Islamic Republic of

    S.H. Zegordi & E. Nikbakhsh

  2. Department of Industrial Engineering, Sharif University of Technology, Tehran, Iran, Islamic Republic of

    M. Modarres

Authors
  1. S.H. Zegordi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. Nikbakhsh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Modarres
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Mechanical, Aerospace and Civil Engineering, The University of Manchester, Sackville Street, M13 9PL, Manchester, UK

    Srichand Hinduja  & Lin Li  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag London Limited

About this paper

Cite this paper

Zegordi, S., Nikbakhsh, E., Modarres, M. (2010). A cutting plane algorithm for solving single machine scheduling problems with uncertain sequence-dependent setup times. In: Hinduja, S., Li, L. (eds) Proceedings of the 36th International MATADOR Conference. Springer, London. https://doi.org/10.1007/978-1-84996-432-6_27

Download citation

  • DOI: https://doi.org/10.1007/978-1-84996-432-6_27

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84996-431-9

  • Online ISBN: 978-1-84996-432-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation