Advertisement

An Improved Iterated Local Search Algorithm for the Permutation Flowshop Problem with Total Flowtime

  • Xingye Dong
  • Ping Chen
  • Houkuan Huang
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 122)

Abstract

Iterated local search (ILS) algorithm is a powerful metaheuristic for the permutation flowshop problem with total flowtime objective. ILS is based on a local search procedure and the procedure needs to be restarted from another solution when the procedure is trapped into a local optima. In the literature, the solution is often generated by slightly perturbing the best solution found so far. By doing so, the search space is relatively narrow and it is easy to lead the search stagnant. In order to improve this situation, a strategy is proposed in this paper to allow the restart solution be generated from a group of solutions, which are drawn from the local optima solutions found in the search process. An ILS algorithm named MRSILS is proposed. Its performance is evaluated on a set of benchmarks. Comparisons show that the MRSILS is significantly better than or comparable to several state-of-the-art metaheuristics.

Keywords

Scheduling Permutation flowshop Total flowtime Metaheuristic Iterated local search 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Johnson, S.M.: Optimal two and three-stage production schedule with setup times included. Naval Research Logistics Quarterly 1, 61–68 (1954)CrossRefGoogle Scholar
  2. 2.
    Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research 1, 117–129 (1976)MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    Rajendran, C., Ziegler, H.: Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. European Journal of Operational Research 155, 426–438 (2004)MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    Rajendran, C., Ziegler, H.: Two ant-colony algorithms for minimizing total flowtime in permutation flowshops. Computers and Industrial Engineering 48, 789–797 (2005)CrossRefGoogle Scholar
  5. 5.
    Tasgetiren, M.F., Liang, Y.-C., Sevkli, M., Gencyilmaz, G.: A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. European Journal of Operational Research 177, 1930–1947 (2007)zbMATHCrossRefGoogle Scholar
  6. 6.
    Zhang, Y., Li, X.P., Wang, Q.: Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization. European Journal of Operational Research 196, 869–876 (2009)MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    Tseng, L.-Y., Lin, Y.-T.: A hybrid genetic local search algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research 198, 84–92 (2009)zbMATHCrossRefGoogle Scholar
  8. 8.
    Tseng, L.-Y., Lin, Y.-T.: A genetic local search algorithm for minimizing total flowtime in the permutation flowshop scheduling problem. International Journal of Production Economics 127, 121–128 (2010)CrossRefGoogle Scholar
  9. 9.
    Jarboui, B., Eddaly, M., Siarry, P.: An estimation of distributation algorithm for minimizing the total flowtime in permutation flowshop scheduling problems. Computers and Operations Research 36, 2638–2646 (2009)MathSciNetzbMATHCrossRefGoogle Scholar
  10. 10.
    Pan, Q.-K., Tasgetiren, M.F., Liang, Y.-C.: A discrete differential evolution algorithm for the permutation flowshop scheduling problem. Computers and Industrial Engineering 55, 795–816 (2008)CrossRefGoogle Scholar
  11. 11.
    Dong, X.Y., Huang, H.K., Chen, P.: An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion. Computers and Operations Research 36, 1664–1669 (2009)MathSciNetzbMATHCrossRefGoogle Scholar
  12. 12.
    Tasgetiren, M.F., Pan, Q.-K., Suganthan, P.N., Chen, A.H.-L.: A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops. Information Sciences 181, 3459–3475 (2011)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Ruiz, R., Stützle, T.: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research 177, 2033–2049 (2007)zbMATHCrossRefGoogle Scholar
  14. 14.
    Chen, P., Huang, H., Dong, X.: Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem. Expert Systems with Applications 37, 1620–1627 (2010)CrossRefGoogle Scholar
  15. 15.
    Pinedo, M.: Scheduling: theory, algorithms, and systems, 2nd edn. Prentice-Hall (2001)Google Scholar
  16. 16.
    Liu, J.Y., Reeves, C.R.: Constructive and composite heuristic solutions to the P//ΣC i scheduling problem. European Journal of Operational Research 132, 439–452 (2001)MathSciNetzbMATHCrossRefGoogle Scholar
  17. 17.
    Taillard, E.: Benchmarks for basic scheduling problems. European Journal of Operational Research 64, 278–285 (1993)zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Xingye Dong
    • 1
  • Ping Chen
    • 2
  • Houkuan Huang
    • 1
  1. 1.School of Computer and ITBeijing Jiaotong UniversityChina
  2. 2.TEDA CollegeNankai UniversityChina

Personalised recommendations