A discrete colonial competitive algorithm for hybrid flowshop scheduling to minimize earliness and quadratic tardiness penalties

Expert Systems with Applications

Volumn 38, Issue 12, 2011, Pages 14490-14498

  Behnamian, J ^a   Zandieh, M ^b  

^a AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

^b SHAHID BEHESHTI UNIVERSITY   (Iran)

Author keywords

Colonial competitive algorithm; Earliness and tardiness penalties; Hybrid flowshops scheduling; Limited waiting time; Mixed integer linear programming

Indexed keywords

COMPETITIVE ALGORITHMS; EARLINESS AND TARDINESS PENALTIES; HYBRID FLOW SHOP; MIXED INTEGER LINEAR PROGRAMMING; WAITING-TIME;

INTEGER PROGRAMMING;

ALGORITHMS;

EID: 80052027258     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2011.04.241     Document Type: Article

References (41)

1. K. Alaykiran, O. Engin, and A. Döyen Using ant colony optimization to solve hybrid flowshop scheduling problems Internationals Journal of Advanced Manufacturing Technology 35 5-6 2007 541 550
2. A. Allahverdi, C.T. Ng, T.C.E. Cheng, and M.Y. Kovalyov A survey of scheduling problems with setup times or costs European Journal of Operational Research 187 2008 985 1032
3. C. Andres Group technology in a hybrid flowshop environment: A case study European Journal of Operational Research 167 2005 272 281
4. E. Atashpaz Gargari, F. Hashemzadeh, R. Rajabioun, and C. Lucas Colonial competitive algorithm: A novel approach for PID controller design in MIMO distillation column process International Journal of Intelligent Computing and Cybernetics (IJICC) 1 3 2008 337 355
5. Atashpaz Gargari, E., Hashemzadeh, F., & Lucas, C. (2008). Designing MIMO PIID controller using colonial competitive algorithm: Applied to distillation column process. In Proceeding of IEEE CEC 2008, within IEEE WCCI 2008, Hong Kong (pp. 1929-1934).
6. E. Atashpaz Gargari, and C. Lucas Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition IEEE Congress on Evolutionary Computation, Singapore 4661-4667 2007
7. M. Azizoglu, E. Cakmak, and S. Kondakci A flexible flowshop problem with total flow time minimization European Journal of Operational Research 132 2001 528 538
8. J. Behnamian, S.M.T. Fatemi Ghomi, and M. Zandieh Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times International Journal of Production Research 2009 10.1080/0020754080255681
9. A. Biabangard-Oskouyi, E. Atashpaz-Gargari, N. Soltani, and C. Lucas Application of imperialist competitive algorithm for materials property characterization from sharp indentation test International Journal of Engineering Simulation 10 1 2009 11 12
10. V. Botta-Genoulaz Hybrid flowshop scheduling with precedence constraints and time lags to minimize maximum lateness International Journal of Production Economics 64 1-3 2000 101 111
11. J-S. Chen Model formulations for the machine scheduling problem with limited waiting time constraints Journal of Information and Optimization Sciences 27 1 2006 225 240
12. M. Gholami, M. Zandieh, and A. Alem-Tabriz Scheduling hybrid flow shop with sequence-dependent setup times and machines with random breakdowns International Journal of Advanced Manufacturing Technology 2008 10.1007/s00170-008-1577-3
13. N.G. Hall, and C. Sriskandarajah A survey of machine scheduling problems with blocking and no-wait in process Operations Research 44 1996 510 525
14. I. Harjunkoski, and I.E. Grossmann Decomposition techniques for multistage scheduling problems using mixed integer and constraint programming methods Computers and Chemical Engineering 26 11 2002 1533 1552
15. A. Janiak, E. Kozan, M. Lichtenstein, and C. Oguz Metaheuristic approaches to the hybrid flowshop scheduling problem with a cost-related criterion International Journal of Production Economics 105 2007 407 424
16. Jasour, A.M., Atashpaz, E. & Lucas, C. (2008). Vehicle fuzzy control using imperialist competitive algorithm. In Second iranian joint congress on fuzzy and intelligent systems (IFIS 2008), Tehran, Iran.
17. A. Khabbazi, E. Atashpaz-Gargari, and C. Lucas Imperialist competitive algorithm for minimum bit error rate beamforming International Journal of Bio-Inspired Computation 1 1-2 2009 125 133
18. Y.-D. Kim, B.-J. Joo, and J.-H. Shin Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint Journal of Heuristics 2008 10.1007/s10732-007-9061-z
19. M.E. Kurz, and R.G. Askin Comparing scheduling rules for flexible flow lines International Journal of Production Economics 85 2003 371 388
20. M.E. Kurz, and R.G. Askin Scheduling flexible flow lines with sequence-dependent setup times European Journal of Operational Research 159 2004 66 82
21. V. Lauff, and F. Werner Scheduling with common due date, earliness and tardiness penalties for multi-machine problems: A survey Mathematical and Computer Modelling 40 2004 637 656
22. G.C. Lee, Y.D. Kim, J.G. Kim, and S.H. Choi A dispatching rule-based approach to production scheduling in a printed circuit board manufacturing system Journal of the Operational Research Society 54 2003 1038 1049
23. S-W. Lin, K-C. Ying, and Z-J. Lee Metaheuristics for scheduling a non-permutation flowline manufacturing cell with sequence dependent family setup times Computers and Operations Research 36 4 2009 1110 1121
24. Liu, S., Cui, J., Li, Y. (2008). Heuristic-tabu algorithm for hybrid flowshop scheduling with limited waiting time. In International Symposium on Computational Intelligence and Design, 2008, ISCID '08, Wuhan, China (Vol. 2, pp. 233-237).
25. M.J.P. Lopes, and J.M.V. de Carvalho A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times European Journal of Operational Research 176 3 2007 1508 1527
26. D.C. Montgomery Design and analysis of experiments 5th ed. 2000 John Wiley & Sons NY
27. B. Naderi, M. Zandieh, A. Khaleghi Ghoshe Balagh, and V. Roshanaei An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness Expert Systems with Applications 36 2009 9625 9633
28. M.L. Pinedo Theory, Algorithms, and Systems 3th ed. 2008 Springer Science + Business Media New York, LLC
29. R. Rajabioun, E. Atashpaz-Gargari, and C. Lucas Colonial competitive algorithm as a tool for nash equilibrium point achievement Lecture Notes in Computer Science 5073 2008 680 695
30. Rajabioun, R., Hashemzadeh, F., Atashpaz-Gargari, E., Mesgari, B., & Rajaei Salmasi, F. (2008). Identification of a MIMO evaporator and its decentralized PID controller tuning using colonial competitive algorithm. Proceedings of the 17th world congress, the international federation of automatic control, Seoul, Korea, July 6-11, 2008 (pp. 9952-9957).
31. R.Z. Rios-Mercado, and J.F. Bard Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups Computers and Operations Research 25 5 1998 351 366
32. T. Sawik Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers Mathematical and Computer Modeling 31 13 2000 39 52
33. L-H. Su A hybrid two-stage flow-shop with limited waiting time constraints Computers and Industrial Engineer 44 2003 409 424
34. L.X. Tang, H. Xuan, and J. Liu A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time Computers and Operations Research 33 2006 3344 3359
35. J.M.S. Valente, and J.F. Gonalves A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties Computers and Operations Research 36 10 2009 2707 2715
36. X. Wang, and L. Tang A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers Computers and Operations Research 36 2009 907 918
37. B. Wardono, and Y. Fathi A tabu search algorithm for the multi-stage parallel machine problems with limited buffer capacities European Journal of Operational Research 155 2004 380 401
38. K-C. Ying An iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor tasks Journal of the Operational Research Society 2008 1 8 10.1057/palgrave.jors.2602625
39. M. Zandieh, S.M.T. Fatemi Ghomi, and S.M. Moattar Husseini An immune algorithm approach to hybrid flowshops scheduling with sequence-dependent setup times Applied Mathematics and Computation 180 2006 111 127
40. Z. Zhu, and R.B. Heady Minimizing the sum of earliness/tardiness in multi-machine scheduling: A mixed integer programming approach Computers and Industrial Engineering 38 2000 297 305
41. V.J. Leon, and B. Ramamoorthy An adaptable problem-space based search method for flexible flow line scheduling IIE Transactions 29 22 1997 115 125