Skip to main content
SpringerLink
Log in

Iterative search method for total flowtime minimization no-wait flowshop problem

  • Original Article
  • Published:
International Journal of Machine Learning and Cybernetics Aims and scope Submit manuscript

Abstract

In this paper, the no-wait flowshop problem with total flowtime minimization is considered. In order to fast evaluate a new solution generated in the searching process in an algorithm, the objective increment properties of fundamental operators are analyzed on the basis of the distance of adjacent jobs in a sequence. An iterative search method is proposed for the considered problem. Two initial solutions are constructed by two investigated heuristics, and assigned as the parent solutions. The parent solutions are improved iteratively by a mini-evolutionary algorithm based on perturbation cycle. Each perturbation cycle consists of a perturb operation and an enhancement process following two strategies: (1) segment-based local search, and (2) iterative global search. The proposed method is compared with the best existing algorithms under the classical benchmark instances. Computational result reveals that the proposed method outperforms the others on effectiveness.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. Pinedo M (2012) Scheduling: theory, algorithms, and systems. Springer, New York

    Book  Google Scholar 

  2. Zhu J, Li X, Shen W (2011) Effective genetic algorithm for resource-constrained project scheduling with limited preemptions. Int J Mach Learn Cybern 2(2):55–65

    Article  Google Scholar 

  3. Hall NG, Sriskandarajah C (1996) A survey of machine scheduling problems with blocking and no-wait in process. Oper Res 44(3):510–525

    Article  MATH  MathSciNet  Google Scholar 

  4. Ruiz R, Maroto C (2005) A comprehensive review and evaluation of permutation flowshop heuristics. Eur J Oper Res 165(2):479–494

    Article  MATH  MathSciNet  Google Scholar 

  5. Wang L, Zheng D-Z (2001) An effective hybrid optimization strategy for job-shop scheduling problems. Comput Oper Res 28(6):585–596

    Article  MATH  MathSciNet  Google Scholar 

  6. MacCarthy B, Liu J (1993) Addressing the gap in scheduling research: a review of optimization and heuristic methods in production scheduling. Int J Prod Res 31(1):59–79

    Article  Google Scholar 

  7. Van Deman JM, Baker KR (1974) Minimizing mean flowtime in the flow shop with no intermediate queues. AIIE Trans 6(1):28–34

    Article  Google Scholar 

  8. Adiri I, Pohoryles D (1982) Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times. Naval Res Logist Q 29(3):495–504

    Article  MATH  MathSciNet  Google Scholar 

  9. Van der Veen JA, Van Dal R (1991) Solvable cases of the no-wait flow-shop scheduling problem. J Oper Res Soc 42(11):971–980

    Article  MATH  Google Scholar 

  10. Rajendran C, Chaudhuri D (1990) Heuristic algorithms for continuous flow-shop problem. Naval Res Logist (NRL) 37(5):695–705

    Article  MATH  Google Scholar 

  11. Bonney M, Gundry S (1976) Solutions to the constrained flowshop sequencing problem. Oper Res Q 27:869–883

    Article  MATH  Google Scholar 

  12. King J, Spachis A (1980) Heuristics for flow-shop scheduling. Int J Prod Res 18(3):345–357

    Article  Google Scholar 

  13. Bertolissi E (2000) Heuristic algorithm for scheduling in the no-wait flow-shop. J Mater Process Technol 107(1):459–465

    Article  Google Scholar 

  14. Aldowaisan T, Allahverdi A (2004) New heuristics for m-machine no-wait flowshop to minimize total completion time. Omega 32(5):345–352

    Article  Google Scholar 

  15. Chen C-L, Neppalli RV, Aljaber N (1996) Genetic algorithms applied to the continuous flow shop problem. Comput Ind Eng 30(4):919–929

    Article  Google Scholar 

  16. Framinan JM, Nagano MS, Moccellin JV (2010) An efficient heuristic for total flowtime minimisation in no-wait flowshops. Int J Adv Manuf Technol 46(9–12):1049–1057

    Article  Google Scholar 

  17. Fink A, Voß S (2003) Solving the continuous flow-shop scheduling problem by metaheuristics. Eur J Oper Res 151(2):400–414

    Article  MATH  Google Scholar 

  18. Gao K, Pan Q, Suganthan P, Li J (2013) Effective heuristics for the no-wait flow shop scheduling problem with total flow time minimization. Int J Adv Manuf Technol 66(9–12):1563–1572

    Article  Google Scholar 

  19. Laha D, Sapkal SU (2014) An improved heuristic to minimize total flow time for scheduling in the m-machine no-wait flow shop. Comput Ind Eng 67:36–43

    Article  Google Scholar 

  20. Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64(2):278–285

    Article  MATH  Google Scholar 

  21. Pan Q-K, Fatih Tasgetiren M, Liang Y-C (2008) A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Comput Oper Res 35(9):2807–2839

    Article  MATH  MathSciNet  Google Scholar 

  22. Zhu X, Li X, Wang X (2009) Objective increment based iterative greedy heuristic for no-wait flowshops with total flowtime minimization. Chin J Comput 31(1):132–141

    Article  MathSciNet  Google Scholar 

  23. Gao K-Z, Pan Q-K, Li J-Q (2011) Discrete harmony search algorithm for the no-wait flow shop scheduling problem with total flow time criterion. Int J Adv Manuf Technol 56(5–8):683–692

    Article  Google Scholar 

  24. Gao K-Z, Pan Q-K, Li J-Q, Wang Y-T, Liang J (2012) A hybrid harmony search algorithm for the no-wait flow-shop scheduling problems. Asia-Pac J Oper Res 29(02):1250012-1–1250012-23

  25. Singh A, Valente JM, Moreira MR (2012) Hybrid heuristics for the single machine scheduling problem with quadratic earliness and tardiness costs. Int J Mach Learn Cybern 3(4):327–333

    Article  Google Scholar 

  26. Rosenkrantz DJ, Stearns RE, Lewis II PM (2009) An analysis of several heuristics for the traveling salesman problem. In: Fundamental problems in computing, Chap 3. Springer, New York, pp 43–68

  27. Iyer SK, Saxena B (2004) Improved genetic algorithm for the permutation flowshop scheduling problem. Comput Oper Res 31(4):593–606

    Article  MATH  MathSciNet  Google Scholar 

  28. Ruiz R, Stützle T (2007) A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. Eur J Oper Res 177(3):2033–2049

    Article  MATH  Google Scholar 

  29. Sevaux M, Dauzere-Peres S (2003) Genetic algorithms to minimize the weighted number of late jobs on a single machine. Eur J Oper Res 151(2):296–306

    Article  MATH  MathSciNet  Google Scholar 

  30. Nearchou AC (2004) The effect of various operators on the genetic search for large scheduling problems. Int J Prod Econ 88(2):191–203

    Article  Google Scholar 

Download references

Acknowledgments

This work is supported by the National Natural Science Foundation of China (Grants 61272377) and the Specialized Research Fund for the Doctoral Program of Higher Education (20120092110027).

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, Southeast University, Nanjing, 211189, China

    Xia Zhu & Xiaoping Li

  2. Key Laboratory of Computer Network and Information Integration, Southeast University, Ministry of Education, Nanjing, China

    Xia Zhu & Xiaoping Li

Authors
  1. Xia Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiaoping Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xia Zhu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhu, X., Li, X. Iterative search method for total flowtime minimization no-wait flowshop problem. Int. J. Mach. Learn. & Cyber. 6, 747–761 (2015). https://doi.org/10.1007/s13042-014-0312-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13042-014-0312-7

Keywords

Search

Navigation