No-wait two stage hybrid flow shop scheduling with genetic and adaptive imperialist competitive algorithms

Journal of Experimental and Theoretical Artificial Intelligence

Volumn 25, Issue 2, 2013, Pages 207-225

  Moradinasab, Nazanin ^a   Shafaei, Rasoul ^a   Rabiee, Meysam ^a,b   Ramezani, Pezhman ^a  

^a K N TOOSI UNIVERSITY OF TECHNOLOGY   (Iran)

^b BU ALI SINA UNIVERSITY   (Iran)

Author keywords

GA; hybrid flow shop; ICA; no wait; setup time

Indexed keywords

ANT COLONY OPTIMISATION; HYBRID FLOW SHOP; IMPERIALIST COMPETITIVE ALGORITHMS; NO-WAIT; RELATIVE PERCENTAGE DEVIATIONS; SET-UP TIME; TOTAL COMPLETION TIME; TWO-STAGE HYBRID FLOW SHOP;

GALLIUM; INDEPENDENT COMPONENT ANALYSIS; SCHEDULING;

GENETIC ALGORITHMS;

EID: 84873729185     PISSN: 0952813X     EISSN: 13623079     Source Type: Journal    
DOI: 10.1080/0952813X.2012.682752     Document Type: Article

References (29)

1. Allahverdi, A, and, Aldowaisan, T. 2001. Minimizing Total Completion Time in a No-wait Flowshop with Sequence-dependent Additive Changeover Times. Journal of the Operational Research Society, 52: 449-462.
2. Atashpaz-Gargari, and Lucas, E.C. (2007), Imperialist Competitive Algorithm: An Algorithm for Optimization Inspired by Imperialist Competitive, in IEEE Congress on Evolutionary computation, Singapore, pp. 4661-4666
3. Bonney, MC, and, Gundry, SW. 1976. Solutions to the Constrained Flow Shop Sequencing Problem. Operational Research Quarterly, 24: 869-883.
4. Forouharfard, S, and, Zandieh, M. 2010. An Imperialist Competitive Algorithm to Schedule of Receiving and Shipping Trucks in Cross-docking Systems. International Journal of Advanced Manufacturing Technology, 51: 1179-1193.
5. Gilmore, PC, and, Gomory, E. 1964. Sequencing a One State-variable Machine: A Solvable Case of the Traveling Salesman Problem. Operations Research, 12: 655-679.
6. Goldberg, DE. 1989. Genetic Algorithms in Search, Optimization and Machine Learning, Reading, MA: Addison-Wesley.
7. Hao, G, Gong, D, Shi, Y, and, Wang, L. 2005. Interactive Genetic Algorithm Based on Landscape of Satisfaction and Taboos. Journal of China University of Mining & Technology, 34 (2): 204-208.
8. Haouari, M, Hidri, L, and, Gharbi, A. 2006. Optimal Scheduling of a Two-stage Hybrid Flow Shop. Mathematical Methods Operations Research, 64: 107-124.
9. Huang, RH, Yang, CL, and, Huang, YC. 2009. No-wait Two-stage Multiprocessor Flow Shop Scheduling with Unit Setup. Internationl Journal of Advanced Manufacturing Technology, 44: 921-927.
10. Jayamohan, MS, and, Rajendran, C. 2000. A Comparative Analysis of Two Different Approaches to Scheduling in Flexible Flow Shops. Production Planning & Control, 11: 572-580.
11. Jolai, F, Sheikh, S, Rabbani, M, and, Karimi, B. 2009. A Genetic Algorithm for Solving No-wait Flexible Flow Lines with Due Window and Job Rejection. The International Journal of Advanced Manufacturing Technology, 42: 523-532.
12. King, JR, and, Spachis, AS. 1980. Heuristics for Flows Hop Scheduling. International Journal of Production Research, 18: 343-357.
13. Mansouri, SA, Moattar-Husseini, SM, and, Zegordi, SH. 2003. A Genetic Algorithm for Multiple Objective Dealing with Exceptional Elements in Cellular Manufacturing. Production Planning & Control, 14: 437-446.
14. Nazari-Shirkouhi, S, Eivazy, H, Ghodsi, R, Rezaie, K, and, Atashpaz-Gargari, E. 2010. Solving the Integrated Product Mix-outsourcing Problem Using the Imperialist Competitive Algorithm. Expert Systems with Applications, 37: 7615-7626.
15. Onwubolu, GC, and, Mutingi, M. 1999. Genetic Algorithm for Minimizing Tardiness in Flow-shop Scheduling. Production Planning & Control, 10: 462-471.
16. Ponnambalam, SG, Ramkumar, V, and, Jawahar, N. 2001. A Multiobjective Genetic Algorithm for Job Shop Scheduling. Production Planning & Control, 12: 764-774.
17. Rabiee, M. Shafaei, R., and Mirzaeian, M. (2010), Generating an Efficient Schedule in a No-wait Two Stage Flexible Flow Shops with Maximizing Utilization, in The International Conference on Industrial Engineering and Business Management (ICIEBM) Jakarta, Indonesia, pp. 555-561
18. Rajendran, C. 1994. A No-wait Flow Shop Scheduling Heuristic for Minimizing Makespan. Journal of the Operational Research Society, 45: 472-478.
19. Rajendran, C, and, Chaudhuri, D. 1990. Heuristic Algorithms for Continuous Flow Shop Problem. Naval Research Logistics, 37: 695-705.
20. Reddi, SS, and, Ramamoorthy, CV. 1972. On the Flow Shop Sequencing Problem with No-wait in Process. Operational Research Quarterly, 23: 323-331.
21. Rock, H. 1984. The Three-machine No-wait Flow Shop Problem is NP-complete. Journal of Associate Computer Machinery, 31: 336-345.
22. Ruiz, R, and, Allahverdi, A. 2007. No-wait Flowshop with Separate Setup Times to Minimize Maximum Lateness. The International Journal of Advanced Manufacturing Technology, 35: 551-565.
23. Santos, DL, Hunsucker, JL, and, Deal, DE. 2001. On Makespan Improvement in Flow Shops with Multiple Processors. Production Planning & Control, 12: 283-295.
24. Shafaei, R, Rabiee, M, and, Mirzaeyan, M. 2011. An Adaptive Neuro Fuzzy Inference System for Makespan Estimation in Multiprocessor No-wait Two Stage Flow Shop. International Journal of Computer Integrated Manufacturing, 24 (10): 888-899.
25. Shokrollahpour, E, Zandieh, M, and, Dorri, B. 2011. A Novel Imperialist Competitive Algorithm for Bi-criteria Scheduling of the Assembly Flowshop Problem. International Journal of Production Research, 49: 3087-3103.
26. Sriscandarajah, C, and, Ladet, P. 1986. Some No-wait Shops Scheduling Problems: Complexity Aspects. European Journal of Operational Research, 24: 424-445.
27. Van Deman, JM, and, Baker, KR. 1974. Minimizing Flowtime in the Flow Shop with no Intermediate Queues. IIE Transactions, 6: 28-34.
28. Wang, Z, Xing, W, and, Bai, F. 2005. No-wait Flexible Flow Shop Scheduling with No-idle Machines. Operations Research Letters, 33: 609-614.
29. Wismer, DA. 1972. Solution of the Flow Shop Sequencing Problem with no Intermediate Queues. Operations Research, 20: 689-697.