Permutation Flowshop Scheduling Problem Using Classical NEH, ILS-ESP Operator

  • Vanita G. Tonge
  • Pravin Kulkarni
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8298)

Abstract

This paper deals with the Permutation Flow Shop scheduling problem with the objective of minimizing the maximum completion time (makespan), which is associated with an efficient utilization of resources. A differential evolutionary algorithm with classical NEH, iterated local search and enhanced swap operator is proposed. The performance of proposed method is evaluated and results are compared with best metaheuristics GA, QIDE by taking examples from OR Library. Experimental results show the proposedmethod superiority for some carlier instances regarding solution quality.

Keywords

Differential Evolution Local Search Algorithm Differential Evolutionary Algorithm Total Completion Time Trial Vector 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Gupta, J.N.D., Stafford Jr., E.: Flowshop scheduling research after five decades. European Journal of Operational Research 169, 699–711 (2006)CrossRefMATHGoogle Scholar
  2. 2.
    Ancău, M.: On Solving Flowshop Scheduling Problems. Proceedings of the Romanian Academy. Series A 13(1), 71–79 (2012)Google Scholar
  3. 3.
    Nawaz, M., Enscore Jr., E.E., Ham, I.: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. OMEGA, The International Journal of Management Science 11(1), 91–95 (1983)CrossRefGoogle Scholar
  4. 4.
    Taillard, E.: Some efficient heuristic methods for the flow-shop sequencing problem. European Journal of Operational Research 47, 67–74 (1990)CrossRefMathSciNetGoogle Scholar
  5. 5.
    Framinan, J.M., Leisten, R., Rajendran, C.: Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem. International Journal of Production Research 41(1), 121–148 (2003)CrossRefMATHGoogle Scholar
  6. 6.
    Das, S., Abraham, A., Chakraborty, U.K., Konar, A.: Differential evolution using a neighborhood based mutation operator. IEEE Trans. Evol. Comput. 13(3), 526–553 (2009) [82] SGoogle Scholar
  7. 7.
    Rahnamayan, S., Tizhoosh, H., Salama, M.M.A.: Oppositionbased differential evolution. IEEE Trans. Evol. Comput. 12(1), 64–79 (2008)CrossRefGoogle Scholar
  8. 8.
    Vesterstrøm, J., Thomson, R.A.: Comparative study of differential evolution, particle swarm optimization, and evolutionary algorithms on numerical benchmark problems. In: Proc. IEEE Congr. Evol. Comput., pp. 1980–1987 (2004)Google Scholar
  9. 9.
    Storn, R., Price, K.V.: Differential evolution: A simple and efficient adaptive scheme for global optimization over continuous spaces. ICSI, USA, Tech. Rep. TR-95-012 (1995), http://icsi.berkeley.edu/~storn/litera.html; Aarts E.H.L., Lenstra, J. K. (edis.): Local Search in Combinatorial Optimization. Wiley, Chichester (1997)
  10. 10.
    Dimitriou, T., Impagliazzo, R.: Towards a rigorous analysis of local optimization algorithms. In: 25th ACM Symposium on the Theory of Computing (1996)Google Scholar
  11. 11.
    Ancău, M.: On Solving Flowshop Scheduling Problem. Series A, vol. 13(1), pp. 71–79. Roceedings of the Romanian Academy (2012)Google Scholar
  12. 12.
    Weinberger, E.: Correlated and uncorrelated fitness landscapes and how to tell the difference. Biological Cybernetics 63, 325–336 (1990)CrossRefMATHGoogle Scholar
  13. 13.
    Juana, A.A., Lourencǫb, H.R., Mateoc, M., Castelláa, Q., Barriosa, B.B.: Ils-Esp: an Efficient, Simple, and Parameter-Free Algorithm for Solving the Permutation Flow-Shop ProblemGoogle Scholar
  14. 14.
    Zheng, T., Yamashiro, M.: Quantom-Inspired Differential Evolutionary Algorithm for Permutative Scheduling ProblemGoogle Scholar
  15. 15.
    Das, S., Suganthan, P.N.: Differential Evolution: A Survey of the State-of-the-art. IEEE Trans. on Evolutionary Computation 15(1), 4–31 (2011)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2013

Authors and Affiliations

  • Vanita G. Tonge
    • 1
  • Pravin Kulkarni
    • 2
  1. 1.Computer TechnologyRajiv Gandhi college of Engg. Reasech and TechnologyChandrapurIndia
  2. 2.Information TechnologyRajiv Gandhi College of Engg. Reasech and TechnologyChandrapurIndia

Personalised recommendations