Group scheduling in flexible flow shops: A hybridised approach of imperialist competitive algorithm and electromagnetic-like mechanism

International Journal of Production Research

Volumn 49, Issue 16, 2011, Pages 4965-4977

  Karimi, N ^a   Zandieh, M ^b   Najafi, A A ^c  

^a ISLAMIC AZAD UNIVERSITY   (Iran)

^b SHAHID BEHESHTI UNIVERSITY   (Iran)

^c K N TOOSI UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

electromagnetic like mechanism; flexible flow shop; group scheduling; imperialist competitive algorithm; Taguchi method

Indexed keywords

COMPETITIVE ALGORITHMS; ELECTROMAGNETIC-LIKE MECHANISM; FLEXIBLE FLOW SHOP; GROUP SCHEDULING; TAGUCHI;

BIOLOGY; COMPETITION; ELECTROMAGNETISM; INDEPENDENT COMPONENT ANALYSIS; MACHINE SHOP PRACTICE; TAGUCHI METHODS;

EVOLUTIONARY ALGORITHMS;

EID: 79960488067     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207543.2010.481644     Document Type: Article

References (15)

1. Spears, W.M. and DeJong, K.A., 1991. On the virtues of parameterized uniform crossover. Proceedings of the 4th international conference on genetic algorithms, 230-236.
2. Storn, R. and Price, K., 1997. Differential evolution -A simple and efficient adaptive scheme for global optimization over continuous spaces. Journal of Global Optimization, 11 (4), 341-359. (Pubitemid 127502202)
3. Taillard, E., 1990. Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research, 47 (1), 65-74. (Pubitemid 20733430)
4. Taillard, E., 1993. Benchmarks for basic scheduling problems. European Journal of Operational Research, 64 (2), 278-285. (Pubitemid 23599340)
5. Tanaev, V.S., Sotskov, Y.N., and Strusevich, V.A., 1994. Scheduling theory. Multi-stage systems. Dordrecht: Kluwer Academic Publishers.
6. Tasgetiren, M.F., et al., 2006. Particle swarm optimization and differential evolution for single machine total weighted tardiness problem. International Journal of Production Research, 44 (22), 4737-4754. (Pubitemid 44536480)
7. Tasgetiren, M.F., et al., 2007. Particle swarm optimization algorithm for makespan and total flowtime minimization in permutation flowshop sequencing problem. European Journal of Operational Research, 177 (3), 1930-1947. (Pubitemid 44780934)
8. Tasgetiren, M.F., et al., 2004. Particle swarm optimization algorithm for permutation flowshop sequencing problem. Ant colony optimization and swarm intelligence (ANTS2004), Brussels, Belgium, 382-390.
9. Tasgetiren, M.F., Pan, Q.-K., and Liang, Y.-C., 2009. A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times. Computers and Operations Research, 36 (6), 1900-1915.
10. Tasgetiren, M.F., et al., 2009a. Chapter 5. Smallest position value approach. In: G. Onwubolu and D. Davendra, eds. Differential evolution: A handbook for global permutation-based combinatorial optimization. Berlin: Springer-Verlag, 139-162.
11. Tasgetiren, M.F., et al., 2009b. A variable parameter search based differential evolution algorithm for real-parameter continuous function optimization. Proceedings of the 2009 congress on evolutionary computation (CEC 2009), 1247-1255.
12. Vachajitpan, P., 1982. Job sequencing with continuous machine operation. Computers and Industrial Engineering, 6 (3), 255-259. (Pubitemid 12567526)
13. Zheng, X.-J. and Teng, H.-F., 2010. A relative position-coded differential evolution for loopbased station sequencing problem. International Journal of Production Research, 48 (18), 5327-5344.
14. Wang, L., 2001. Intelligence optimization algorithm with applications. Beijing, China: Tsinghua University press.
15. Woollam, C.R., 1986. Flowshop with no idle machine time allowed. Computers and Industrial Engineering, 10 (1), 69-76. (Pubitemid 16523739)