Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm

Soft Computing

Volumn 12, Issue 5, 2008, Pages 435-452

  Rahimi Vahed, Alireza ^a   Mirzaei, Ali Hossein ^a  

^a TARBIAT MODARES UNIVERSITY   (Iran)

Author keywords

Bi criteria permutation flow shop scheduling; Multi objective genetic algorithm; Multi objective shuffled frog leaping algorithm

Indexed keywords

ALGORITHMS; OPTIMIZATION; SOFT COMPUTING;

FROG-LEAPING ALGORITHM; MULTI-OBJECTIVE GENETIC ALGORITHM; PERMUTATION FLOW SHOP SCHEDULING;

STATISTICAL METHODS;

EID: 37249011258     PISSN: 14327643     EISSN: 14337479     Source Type: Journal    
DOI: 10.1007/s00500-007-0210-y     Document Type: Article

References (35)

1. Gupta JND, Stafford Jr EF (2006) Flow shop scheduling research after five decades. Eur J Oper Res 169:699-711
2. Baker KR (1974) Introduction to sequencing and scheduling. Wiley, New York
3. Murata T, Ishibuchi H, Tanaka H (1996) Multi-objective genetic algorithm and its applications to flow shop scheduling. Comput Indus Eng 30:957-968
4. Suliman SMA (2000) A two-phase heuristic approach to the permutation flow shop scheduling problem. Int J Product Econ 64:143-152
5. Cheng J, Steiner G, Stephenson P (2001) A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times. Eur J Oper Res 130:559-575
6. Grabowski J, Wodecki M (2004) A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion. Comput Oper Res 31:1891-1909
7. Solimanpur M, Vrat P, Shankar R (2004) A neuro-tabu search heuristic for flow shop scheduling problem. Comput Oper Res 31:2151-2164
8. Wang J-B, Daniel Ng CT, Cheng TCE, Li-Li Liu (in press) Minimizing total completion time in a two-machine flow shop with deteriorating jobs. Appl Math Comput
9. Ponnambalam SG, Jagannathan H, Kataria M, Gadicherla A (2004) A TSP-GA multi-objective algorithm for flow shop scheduling. Int J Adv Manufact Technol 23:909-915
10. Toktas B, Azizoglu M, Koksalan SK (2004) Two-machine flow shop scheduling with two criteria: Maximum earliness and makespan. Eur J Oper Res 157:286-295
11. Ravindran D, Noorul Haq A, Selvakuar SJ, Sivaraman R (2005) Flow shop scheduling with multiple objective of minimizing makespan and total flow time. Int J Adv Manufact Technol 25:1007-1012
12. Collette Y, Siarry P (2003) Multiobjective optimization: Principles and case studies. Springer, Heidelberg
13. Schaffer JD (1985). Multiple objective optimization with vector evaluated genetic algorithms. In: Schaffer JD (eds) Genetic algorithms and their applications: Proceedings of the first international conference on genetic algorithms. Lawrence Erlbaum, Hillsdale, NJ, pp 93-100
14. Fonseca CM, Fleming PJ (1993) Genetic algorithms for multi-objective optimization: Formulation, discussion and generalization. In: Forrest S (ed) Proceedings of the fifth international conference on genetic algorithms, San Mateo, CA, University of Illinois at Urbana-Champaign. Morgan Kaufman Publishers, 1993, pp 416-423
15. Horn J, Nafpliotis N, Goldberg DE (1994) A niched Pareto genetic algorithm for multi-objective optimization. In: Proceedings of the 1st IEEE-ICEC conference, pp 82-87
16. Deb K (1999) Multi-objective genetic algorithms: Problem difficulties and construction of test problems. Evolut Comput J 7(3):205-230
17. Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evolut Comput 6(2):182-197
18. Hyun CJ, Kim Y, Kim YK (1998) A genetic algorithm for multiple objective sequencing problems in mixed model assembly lines. Comput Oper Res 25(7-8):675-690
19. Jaszkiewicz A (1999) Genetic local search for multiple objective combinatorial optimization. Technical Report RA-014/98, Institute of Computing Science, Poznan University of Technology
20. Zitzler E, Laumanns M, Thiele L (2001a) SPEA2: Improving the strength Pareto evolutionary algorithm. In: Giannakoglou K, Tsahalis D, Periaux J, Papailou P, Fogarty T (eds) EUROGEN 2001, evolutionary methods for design, optimization and control with applications to industrial problems, Athens, Greece, pp 95-100
21. Zitzler E, Laumanns M, Thiele L (2001b) SPEA2: Improving the strength pareto evolutionary algorithm. Report 103, Computer Engineering and Networks Laboratory (TIK)
22. Coello Coello CA, Toscano Pulido G (2001) A micro-genetic algorithm for multiobjective optimization. In: Zitzler E, Deb K, Thiele L, Coello Coello CA, Corne D (eds) First international conference on evolutionary multi-criterion optimization Lecture notes in computer sciences, vol 1993. Springer, Heidelberg, pp 126-140
23. Knowles JD, Corne DW (1999) The Pareto archieved evolution strategy: A new baseline algorithm for multiobjective optimization. In: Congress on evolutionary computation, Washington, DC, IEEE Service Center, pp 98-105
24. Pilegaard Hansen M (1997) Tabu search in multiobjective optimization: MOTS. In: Proceedings of the 13th international conference on multiple criteria decision making (MCDM_97), Cape Town, South Africa
25. Beausoleil RP (2006) "MOSS" multiobjective scatter search applied to non-linear multiple criteria optimization. Eur J Oper Res 169: 426-449
26. Eusuff M, Lansey K, Pasha F (2006) Shuffled frog-leaping algorithm: A memetic meta-heuristic for discrete optimization. Eng Optim 38(2):129-154
27. Dawkins R (1976) The selfish gene. Oxford University Press, Oxford
28. Lian Z, Gu X, Jiao B (in press) A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan. Chaos, Soliton & Fractals
29. Eusuff MM, Lansey KE (2003) Optimizing of water distribution network design using the shuffled frog leaping algorithm. J Water Resour Planning Manage 129(3):210-225
30. Elbeltagi E, Hegazy T, Grierson D (2005) Comparison among five evolutionary-based optimization algorithms. Adv Eng Inform 19:43-53
31. Ben-Daya M, Al-Fawzan M (1998) A tabu search approach for the flow shop scheduling problem. Eur J Oper Res 109:88-95
32. Veldhuizen DV, Lamont G (1999) In: Carroll J, Haddad H, Oppenheim D, Bryant B, Lamont G (eds) Multi-objective evolutionary algorithm test suites, pp 351-357
33. Srinivas N, Deb K (1994) Multi-objective optimization using non-dominated sorting in genetic algorithms. Evolut Comput 2(2):221-248
34. McMullen PR (1998) JIT sequencing for mixed-model assembly lines with setups using tabu search. Product Planning Control 9(5):504-510
35. Xu J, Chiu SY, Glover F (1998) Fine-tuning a tabu search algorithm with statistical tests. Int Trans Oper Res 5(3):233-244