Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Advertisement

Springer Nature Link
Log in

A multi-objective particle swarm for a flow shop scheduling problem

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

Flow shop problems as a typical manufacturing challenge have gained wide attention in academic fields. In this paper, we consider a bi-criteria permutation flow shop scheduling problem, where weighted mean completion time and weighted mean tardiness are to be minimized simultaneously. Since a flow shop scheduling problem has been proved to be NP-hard in strong sense, an effective multi-objective particle swarm (MOPS), exploiting a new concept of the Ideal Point and a new approach to specify the superior particle's position vector in the swarm, is designed and used for finding locally Pareto-optimal frontier of the problem. To prove the efficiency of the proposed algorithm, various test problems are solved and the reliability of the proposed algorithm, based on some comparison metrics, is compared with a distinguished multi-objective genetic algorithm, i.e. SPEA-II. The computational results show that the proposed MOPS performs better than the genetic algorithm, especially for the large-sized problems.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

  • Akpan EOP (1996) Job shop sequencing problems via network scheduling technique. Int J Oper Prod Manage 16(3):76–86

    Article  Google Scholar 

  • Beausoleil RP (2006) “MOSS” multi-objective scatter search applied to non-linear multiple criteria optimization European. J Oper Res 169:426–449

    Article  MATH  MathSciNet  Google Scholar 

  • Ben-Daya M, Al-Fawzan M (1998) A tabu search approach for the flow shop scheduling problem. Eur J Oper Res 109:88–95

    Article  MATH  Google Scholar 

  • Blazewicz J, Domschke W, Pesch E (1996) The job shop scheduling problem: conventional and new solution techniques. Eur J Oper Res 93:1–33

    Article  MATH  Google Scholar 

  • Blazewicz J, Pesch E, Sterna M, Werner F (2005a) A comparison of solution procedures for two-machine flow shop scheduling with late work criterion. Comput Ind Eng 49:611–624

    Article  Google Scholar 

  • Blazewicz J, Pesch E, Sterna M, Werner F (2005b) The two-machine flow shop problem with weighted late work criterion and common due date. Eur J Oper Res 165:408–415

    Article  MathSciNet  Google Scholar 

  • Bulfin RL, M’Hallah R (2003) Minimizing the weighted number of tardy jobs on a two-machine flow shop. Comput Oper Res 30:1887–1900

    Article  MATH  MathSciNet  Google Scholar 

  • CA, Corne D (eds) (2001) First international conference on evolutionary multi-criterion optimization. Lecture Notes in Computer Sciences, No 1993, Springer-Verlag, pp 126–140

  • Chen L-H, Chen Y-H (1996) A design procedure for a robust job shop manufacturing system under a constraint using computer simulation experiments. Comput Ind Eng 30(1):1–12

    Article  MATH  Google Scholar 

  • Choi B-C, Yoon S-H, Chung S-J (2005) Minimizing maximum completion time in a proportionate flow shop with one machine of different speed. Eur J Oper Res (2005) Article in Press

  • Clerc M (1999) The swarm and the queen: towards a deterministic and adaptive particle swarm optimization. In: Proc. ICEC, Washington, DC, pp 1951–1957

  • Coello Coello CA, Lechuga MS (2002) MOPSO: A proposal for multiple objective particle swarm optimization. In: Proceedings of the 2002 congress on evolutionary computation vol 2, pp 1051–1056

  • Coello Coello CA, Pulido GT, Lechuga MS (2004) Handling multiple objectives with particle swarm optimization. IEEE Trans Evolutionary Comput 8(3):256–279

    Article  Google Scholar 

  • Collette Y, Siarry P (2003) Multi-objective optimization: principles and case studies

  • Coello Coello CA, Toscano Pulido G (2001) A micro-genetic algorithm for multi-objective optimization. In: Zitzler E, Deb K, Thiele L, Coello CA Coello, Corne D (eds) First international conference on evolutionary multi-criterion optimization, Lecture Notes in Computer Sciences, No. 1993, Springer-Verlag: 2001, pp 126–140

  • Danneberg D, Tautenhahn T, Werner F(1999) A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size. Math Comput Model 29:101–126

    Google Scholar 

  • Deb K (1999) Multi-objective genetic algorithms: problem difficulties and construction of test problems. Evolut Comput J 7(3):205–230

    MathSciNet  Google Scholar 

  • Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans Evolut Comput 6(2):182–197

    Article  Google Scholar 

  • Eberhart RC, Kennedy J (1995a) A new optimizer using particle swarm theory. In: Proceedings of the sixth international symposium on micro machine and human science. Nagoya, Japan, pp 39–43

  • Eberhart RC, Kennedy J (1995b) A new optimizer using particle swarm theory. In: Proceedings of the sixth international symposium on micro machine and human science. Nagoya, Japan, pp 39–43

  • Fieldsend JE, Singh S (2002) A multi-objective algorithm based upon particle swarm optimization, an efficient data structure and turbulence. In: Proceedings of the 2002 UK workshop on computational intelligence, pp 37–44

  • Fink A, Vob S (2003) Solving the continuous flow shop scheduling problem by metaheuristics. Eur J Oper Res 151:400–414

    Article  MATH  Google Scholar 

  • 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, California, University of Illinois at Urbana-Champaign: Morgan Kaufman Publishers, pp 416–423

  • Grabowski J, Pempera J (2005) Some local search algorithms for no-wait flow shop problem with makespan criterion. Comput Oper Res 32:2197–2212

    Article  MATH  MathSciNet  Google Scholar 

  • Gupta JND, Stafford Jr EF (2006) Flow shop scheduling research after five decades. Eur J Oper Res 169:699–711

    Google Scholar 

  • Horn J, Nafpliotis N, Goldberg DE (1994) A niched Pareto genetic algorithm for multi-objective optimization. In: Proc of 1st IEEE-ICEC conference, pp 82–87

  • Hu X, Eberhart R (2002) Multi-objective optimization using dynamic neighborhood particle swarm optimization. In: Proceedings of the 2002 congress on evolutionary computation vol 2, pp 1677–1681

  • Hu X, Eberhart R, Shi Y (2003) Particle swarm with extended memory for multi-objective optimization. In: Proceedings of the 2003 IEEE Swarm Intelligence Symposium, Indianapolis, pp 193–197

  • Hu X, Shi Y, Eberhart RC (2004) Recent advances in particle swarm. In: Proceedings of the IEEE congress on evolutionary computation, Oregon, Portland vol 2, pp 90–97

  • 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

    Google Scholar 

  • Jaszkiewicz A (1999) Genetic local search for multiple objective combinatorial optimization. Technical Report RA-014/98, Institute of Computing Science, Poznan University of Technology. Technical Report

  • Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proceedings of the 1995 IEEE international conference on neural networks 4:1942–1948

  • Knowles JD, Corne DW (1999) The Pareto archieved evolution strategy: a new baseline algorithm for multi-objective optimization. In: Congress on Evolutionary Computation, Washington, DC, IEEE Service Center, pp 98–105

  • Lian Z, Gu X, Jiao B (2006) A similar particle swarm optimization algorithm for permutation flow shop scheduling to minimize makespan. Appl Math Comput 175:773–785

    Article  MATH  MathSciNet  Google Scholar 

  • Loukil T, Teghem J, Tuyttens D (2005) Solving multi-objective production scheduling problems using metaheuristics. Eur J Oper Res 161:42–61

    Article  MATH  MathSciNet  Google Scholar 

  • Luh G-C, Chueh C-H, Liu W-W (2003) Moia: multi-objective immune algorithm. Eng Optim 35:143–164

    Article  MathSciNet  Google Scholar 

  • Marett R, Wright M (1996) A comparison of neighborhood search techniques for multi-objective combinatorial problems. Comput Oper Res 23:465–483

    Article  MATH  Google Scholar 

  • Moore J, Chapman R (1999) Application of particle swarm to multi-objective optimization. Department of Computer Science and Software Engineering, Auburn University, 1999

  • Murata T, Ishibuchi H, Tanaka H (1996) Multi-objective genetic algorithm and its applications to flow shop scheduling. Comput Ind Eng 30:957–968

    Article  Google Scholar 

  • Nowicki E, Smutnicki C (2006) Some aspects of scatter search in the flow shop problem. Eur J Oper Res 169:654–666

    Article  MATH  MathSciNet  Google Scholar 

  • Pan JC-H, Chen J-S, Chao C-M (2002) Minimizing tardiness in a two-machine flow shop. Comput Oper Res 29:869–885

    Article  MATH  MathSciNet  Google Scholar 

  • Parsopoulos KE, Vrahatis MN (2002) Particle swarm optimization method in multi-objective problems. In: Proceedings of the 2002 ACM symposium on applied computing, pp 603–607

  • Parsopoulos KE, Tasoulis DK, Vrahatis MN (2004) Multi-objective optimization using parallel vector evaluated particle swarm optimization. In: Proceedings of the IASTED international conference on artificial intelligence and applications 2:823–828

  • Pilegaard HM (1997) Tabu search in multi-objective optimization: MOTS. in: Proceedings of the 13th international conference on multiple criteria decision making (MCDM_97), Cape Town, South Africa

  • Pinedo M (1995) Scheduling: theory algorithms and systems. Englewood Cliffs, Prentice-Hall, New Jersey

    Google Scholar 

  • Ponnambalam SG, Jagannathan H, Kataria M, Gadicherla A (2004) A TSP-GA multi-objective algorithm for flow shop scheduling. Int J Adv Manufacturing Tech 23:909–915

    Google Scholar 

  • Rahmati A (1998) Representation of hybrid genetic algorithm for solving non-classic job shop scheduling problems. MS Eng Thesis. Faculty of engineering, University of Tehran (in Persian)

  • 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 Manufacturing Tech 25:1007–1012

    Article  Google Scholar 

  • Sayin S, Karabati S (1999) Abicriteria approach to the two-machine flow shop scheduling problem. Eur J Oper Res 113:435–449

    Article  MATH  Google Scholar 

  • Schaffer JD (1985) Multiple objective optimization with vector evaluated genetic algorithms. In: Schaffer JD (ed), Genetic algorithms and their applications: proceedings of the first international conference on genetic algorithms, Lawrence Erlbaum, Hillsdale, New Jersey, pp 93–100

  • Shi Y, Eberhart RC (1998) A modified particle swarm optimizer. In: Proceedings of the IEEE congress on evolutionary computation. Piscataway, NJ, pp 69–173

  • Shi Y, Eberhart R (1998) Parameter selection in particle swarm optimization. In: Evolutionary programming VIZ: Proc. EP98, Springer Verlag, New York, pp 591–600

  • Solimanpur M, Vrat P, Shankar R (2004) A neuro-tabu search heuristic for flow shop scheduling problem. Comput Oper Res 31:2151–2164

    Article  MATH  Google Scholar 

  • Tasgetiren MF, Sevkli M, Liang YC, Gencyilmaz G (2004a) Particle swarm optimization algorithm for single machine total weighted tardiness problem. In: Proceedings of the IEEE congress on evolutionary computation, Oregon, Portland vol 2, pp 1412–1419

  • Tasgetiren MF, Liang YC, Sevkli M, Gencyilmaz G (2004b) Particle swarm optimization algorithm for makespan and maximum lateness minimization in permutation flow shop sequencing problem. In: Proceedings of the fourth international symposium on intelligent manufacturing systems, Sakarya, Turkey, pp 431–41

  • 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

    Article  MATH  Google Scholar 

  • Wang J-B, Daniel Ng CT, Cheng TCE, Li-Li Liu (2006) Minimizing total completion time in a two-machine flow shop with deteriorating jobs, Appl Math Comput (2006) Article in Press

  • 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

  • Zitzler E, Laumanns M, Thiele L (2001b) SPEA2: Improving the strength pareto evolutionary algorithm. Computer Engineering and Networks Laboratory (TIK) -Report 103 Sept 2001

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Faculty of Engineering, University of Tehran, Tehran, Iran

    A. R. Rahimi-Vahed & S. M. Mirghorbani

Authors
  1. A. R. Rahimi-Vahed
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. M. Mirghorbani
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. R. Rahimi-Vahed.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rahimi-Vahed, A.R., Mirghorbani, S.M. A multi-objective particle swarm for a flow shop scheduling problem. J Comb Optim 13, 79–102 (2007). https://doi.org/10.1007/s10878-006-9015-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-006-9015-7

Keywords

Search

Navigation