Skip to main content
SpringerLink
Log in

A GRASP based on DE to solve single machine scheduling problem with SDST

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

When handling combinatorial optimization problems, we try to get the optimal arrangement of discrete entities so that the requirements and the constraints are satisfied. These problems become more and more important in various industrial and academic fields. So, over the past years, several techniques have been proposed to solve them. In this paper, we are interested in the single machine scheduling problem with Sequence-Dependent Setup Times, which can be solved through different approaches. We present a hybrid algorithm which combines Greedy Randomized Adaptive Search Procedure and Differential Evolution for tackling this problem. Our algorithm is tested on benchmark instances from the literature. The computational experiments prove the efficiency of this algorithm.

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

Access this article

Log in via an institution

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. Bigras, L.P., Gamache, M., Savard, G.: The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times. Discrete Optim. 5, 685–699 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  2. Choobineh, F.F., Mohebbi, E., Khoo, H.: A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times. Eur. J. Oper. Res. 175, 318–337 (2006)

    Article  MATH  Google Scholar 

  3. Das, S.R., Gupta, J.N.D., Khumawala, B.M.: A savings index heuristic algorithm for flowshop scheduling with sequence dependent set-up times. J. Oper. Res. Soc. 46, 1365–1373 (1995)

    MATH  Google Scholar 

  4. Du, J., Leung, J.Y.T.: Minimizing total tardiness on one machine is NP-hard. Math. Oper. Res. 15, 483–495 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  5. Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6, 109–133 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  6. Feo, T.A., Venkatraman, K., Bard, J.F.: A GRASP for a difficult single machine scheduling problem. Comput. Oper. Res. 18, 635–643 (1991)

    Article  MATH  Google Scholar 

  7. Feo, T.A., Sarathy, K., McGahan, J.: A GRASP for single machine scheduling with sequence dependent setup costs and linear delay penalties. Comput. Oper. Res. 23, 881–895 (1996)

    Article  MATH  Google Scholar 

  8. Festa, P., Pardalos, P.M., Resende, M.G.C., Ribeiro, C.C.: GRASP and VNS for Max-Cut. In: Extended Abstracts of the Fourth Metaheuristics International Conference, pp. 371–376, Porto, July (2001)

  9. França, P.M., Gendreau, M., Laporte, G., Müller, F.M.: A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times. Int. J. Prod. Econ. 43, 79–89 (1996)

    Article  Google Scholar 

  10. França, P.M., Mendes, A., Moscato, P.: A memetic algorithm for the total tardiness single machine scheduling problem. Eur. J. Oper. Res. 132, 224–242 (2001)

    Article  MATH  Google Scholar 

  11. Gagné, C., Price, W.L., Gravel, M.: Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times. J. Oper. Res. Soc. 53, 895–906 (2002)

    Article  MATH  Google Scholar 

  12. Gagné, C., Gravel, M., Price, W.L.: Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems. J. Oper. Res. Soc. 56, 687–698 (2005)

    Article  MATH  Google Scholar 

  13. Gravel, M., Price, W.L., Gagné, C.: Scheduling jobs in an alcan aluminium foundry using a genetic algorithm. Int. J. Prod. Res. 38, 3031–3041 (2000)

    Article  Google Scholar 

  14. Gupta, S.R., Smith, J.S.: Algorithms for single machine total tardiness scheduling with sequence dependent setups. Eur. J. Oper. Res. 175, 722–739 (2006)

    Article  MATH  Google Scholar 

  15. Hansen, P., Mladenović, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130, 449–467 (2001)

    Article  MATH  Google Scholar 

  16. Liao, C.J., Yu, W.C.: Sequencing heuristics for dependent setups in a continuous process industry. Omega—Int. J. Manag. Sci. 24, 649–659 (1996)

    Article  Google Scholar 

  17. Liao, C.J., Chen, W.J.: Scheduling under machine breakdown in a continuous process industry. Comput. Oper. Res. 31, 415–428 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  18. Liao, C.J., Juan, H.C.: An ant colony optimization for ACO single-machine tardiness scheduling with sequence-dependent setups. Comput. Oper. Res. 34, 1899–1909 (2007)

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  20. Luo, X., Chu, C.: A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness. Eur. J. Oper. Res. 180, 68–81 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  21. Mladenović, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24, 1097–1100 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  22. Ozgur, C.O., Brown, J.R.: A two-stage traveling salesman procedure for the single machine sequence-dependent scheduling problem. Omega—Int. J. Manag. Sci. 23, 205–219 (1995)

    Article  Google Scholar 

  23. Potts, C.N., Van Wassenhove, L.N.: A branch and bound algorithm for the total weighted tardiness problem. Oper. Res. 33, 363–377 (1985)

    Article  MATH  Google Scholar 

  24. Ragatz, G.L.: A branch-and-bound method for minimum tardiness sequencing on a single processor with sequence dependent setup times. In: Proceedings of the twenty-fourth annual meeting of the Decision Sciences Institute, pp. 1375–1377 (1993)

  25. Rubin, P.A., Ragatz, G.L.: Scheduling in a sequence dependent setup environment with genetic search. Comput. Oper. Res. 22, 85–99 (1995)

    Article  MATH  Google Scholar 

  26. Selen, W.J., Heuts, R.M.J.: Operational production planning in a chemical manufacturing environment. Eur. J. Oper. Res. 45, 38–46 (1990)

    Article  Google Scholar 

  27. Storn, R., Price, K.: Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 11, 341–359 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  28. Sun, X., Noble, J.S., Klein, C.M.: Single-machine scheduling with sequence dependent setup to minimize total weighted squared tardiness. IIE Trans. 31, 113–124 (1999)

    Google Scholar 

  29. Tan, K.C., Narasimhan, R.: Minimizing tardiness on a single processor with sequence-dependent setup times: a simulated annealing approach. Omega—Int. J. Manag. Sci. 25, 619–634 (1997)

    Article  Google Scholar 

  30. Tan, K.C., Narasimhan, R., Rubin, P.A., Ragatz, G.L.: A comparison of four methods for minimizing total tardiness on a single processor with sequence dependent setup times. Omega—Int. J. Manag. Sci. 28, 313–326 (2000)

    Article  Google Scholar 

  31. Ying, K.C., Lin, S.W., Huang, C.Y.: Sequencing single-machine tardiness problems with sequence dependent setup times using an iterated greedy heuristic. Expert Syst. Appl. 36, 7087–7092 (2009)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. GIAD, FSEGS, Route de l’Aéroport km 4, Sfax, 3018, Tunisie

    Hanen Akrout, Bassem Jarboui & Abdelwaheb Rebaï

  2. Institut Supérieur de Commerce et de Comptabilité de Bizerte, Zarzouna, 7021, Bizerte, Tunisie

    Bassem Jarboui

  3. LiSSi, Université de Paris 12, 61 avenue du Général de Gaulle, 94010, Créteil, France

    Patrick Siarry

Authors
  1. Hanen Akrout
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bassem Jarboui
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Patrick Siarry
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Abdelwaheb Rebaï
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Patrick Siarry.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Akrout, H., Jarboui, B., Siarry, P. et al. A GRASP based on DE to solve single machine scheduling problem with SDST. Comput Optim Appl 51, 411–435 (2012). https://doi.org/10.1007/s10589-010-9333-7

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-010-9333-7

Keywords

Search

Navigation