Minimization of maximum tardiness in a no-wait two stage flexible flow shop

International Journal of Artificial Intelligence

Volumn 8, Issue 12 S, 2012, Pages 166-181

  Moradi nasab, Nazanin ^a   Shafaei, Rasoul ^a   Rabiee, Meysam ^a   Mazinani, Mostafa ^a  

^a K N TOOSI UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

Flexible flow shop; ICA; No wait; PSO

Indexed keywords

EID: 84863570724     PISSN: 09740635     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (25)

1. Aldowaisan, T. and Allahverdi A., 2004, New heuristics for m-machine no-wait flow shop to minimize total completion time, Omega, 345-52.
2. Aldowiasan, T. and Allahverdi, A., 1998, Total flow time in no-wait tow shops with separated setup times, Computers & Operations Research, 25, 757-65.
3. Aldowiasan, T., 2000, A new heuristic and dominance relations for no-wait flow shops with setups. Computers & Operations Research, 28, 563-84.
4. Allahverdi, A. and Aldowaisan, T., 2000, No-wait and separate setup three-machine flowshopwith total completion time criterion. International Transactions in Operational Research, 7, 245-64.
5. Anghinolfi, D. and Paolucci, M., 2009, A new discrete particle swarm optimization approach for the single machine total weighted tardiness scheduling problem with sequence-dependent setup times. European Journal of Operational Research, 193(1), 73-85
6. Atashpaz-Gargari, E. and Lucas, C., 2007, Imperialist Competitive Algorithm: An algorithm for optimization inspired by imperialist competitive, Proceeding IEEE Congress on Evolutionary computation, Singapore. 4661-4667
7. Behnamian, J. and Zandieh, M., 2011, A discrete colonial competitive algorithm for hybrid flowshop scheduling to minimize earliness and quadratic tardiness penalties, Expert Systems with Applications, doi:10.1016/j.eswa.2011.04.241
8. Framinan, J.M. and Nagano, M.S., 2007, Evaluating the performance for makespan minimization in no-wait flow shop sequencing. Journal of materials processing technology, 197, 1-9.
9. Gilmore, P.C. and Gomory, E., 1964, Sequencing a one state-variable machine: A Solvable Case of the Travelling Salesman Problem. Operations Research, 12(5), 655-679.
10. Huang, R. H., Yang C. L. and Huang Y., 2009, No-wait two-stage multiprocessor flow shop scheduling with unit setup, International Journal of Advanced Manufacturing Technology, 44, 921-927.
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. International Journal of Advanced Manufacturing Technology, 42,523-532.
12. Kennedy, J. and Eberhart, R. 1995. Particle Swarm Optimization IEEE International Conference on Neural Networks. Perth, Australia, 1942-48.
13. Khalouli, S., Ghedjati, F. and Hamzaoui, A., 2010, A meta-heuristic approach to solve a JIT scheduling problem in hybrid flow shop, Engineering Applications of Artificial Intelligence. 23, 765-771.
14. Lian, Z., Gu, X. and Jiao, B., 2006, A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan. Applied Mathematics and Computation, 183, 1008-17.
15. Nguyen, V., 1998. A Multiclass Hybrid Production Center in Heavy Traffic. Operations Research, 46(3), 13-25.
16. Pan, Q.K., Tasgetiren, M.F. and Liang, Y.C., 2008, A discrete particle swarm optimization algorithm for the no-wait flow shop scheduling problem. Computers & Operations Research, 35, 2807-2839.
17. Rezazadeh, H., Ghazanfari, M., Saidi-Mehrabad, M. and Sadjadi, S.J., 2009, An Extended Discrete Particle Swarm Optimization Algorithm for the Dynamic Facility Layout Problem. Journal of Zhejiang University Science, 10, 520-529.
18. Shi, X.H., Liang, Y.C., Lee, H.P., Lu, C. and Wang, Q.X., 2007, Particle swarm optimization-based algorithms for TSP and generalized TSP. Information Processing Letters, 103,169-76.
19. Shokrollahpour, E., Zandieh, M. and Dorri, D., 2010, A novel imperialist competitive algorithm for bicriteria scheduling of the assembly flowshop problem, International Journal of Production Research,49(11), 3087-3103.
20. Sriscandarajah, C. and Ladet, P., 1986, some no wait shops scheduling problems: Complexity aspects. European journal of Operationalresearch. 24: 424-445.
21. Tasgetiren, M.F., Liang Y-C, Sevkli, M. and Gencyilmaz, G., 2007, A particle swarm optimization algorithm for makespan and total flowtimeminimization in the permuta-tion flowshop sequencing problem. European Journal of Operational Research, 177,1930-1947.
22. Tseng, L.U., and Lin, Y.T., 2010, A hybrid genetic algorithm for no-wait flowshop scheduling problem. International Journal of Production Economics, 128, 144-152.
23. Xie, J. and Wang, X., 2005, Complexity and Algorithms for Two-Stage Flexible Flow shop Scheduling with Availability Constraints, Computer and Mathematics with Application. 50, 1629-1638.
24. Xie, J., Xing, W., Liu, Z. & Dong, J. 2004. Minimum deviation algorithm for two-stage no-wait flowshops with parallel machines. Computers & Mathematics with Applications, 47(12), 1857-63.
25. Zhixin, L., Xie, J., Li, J. and Dong, J., 2003, A heuristic for two-stage no-wait hybrid flowshop scheduling with a single machine in either stage, Tsinghua Science and Technology, 8, 43-48.