Efficient meta heuristic algorithms to minimize mean flow time in no-wait two stage flow shops with parallel and identical machines

International Journal of Management Science and Engineering Management

Volumn 6, Issue 6, 2011, Pages 421-430

  Shafaei, Rasoul ^a   Moradinasab, Nazanin ^a   Rabiee, Meysam ^a  

^a K N TOOSI UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

ACO; Flexible flow shop; ICA; No wait; PSO

Indexed keywords

EID: 84906243187     PISSN: 17509653     EISSN: 17509661     Source Type: Journal    
DOI: 10.1080/17509653.2011.10671192     Document Type: Article

References (29)

1. Aldowaisan, T., and Allahverdi, A., 2004. A New heuristics for m-machine no-wait flow shop to minimize total completion time. Omega, 32:345–352.
2. Allaoui, H., and Artiba, A., 2004. Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints. Computer Industrial Enginneering, 47:431–450.
3. Arthanari, T., and Ramaurthy, K., 1971. An extension of two machines sequencing problem. Operations Research, 41:641–648.
4. Atashpaz-Gargari, E., and Lucas, C., 2007. “ Imperialist competitive algorithm:An algorithm for optimization inspired by imperialist competitive ”. In IEEE Congress on Evolutionary computation Singapore In
5. Behnamian J., et al. Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flow shop with sequence-dependent setup times International Journal of Production Research 2010 48 5 1415 1438
6. 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
7. Candar, O., 1999. “ Machine scheduling problems with blocking and no-wait in process ”. In Department of Industrial Engineering, Research Report Bilkunt University.
8. Chen W., et al. Workflow scheduling in grids:An ant colony optimization approach IEEE Congress on Evolutionary Computation Singapore2007 In
9. Gholami, M., Zandieh, M., and Alem-Tabriz, A., 2008. Scheduling hybrid flow shop with sequence-dependent setup times and machines with random breakdowns. International Journal of Advanced Manufacturing Technology, doi:10.1007/710 s00170-008-1577-3
10. Gilmore, P., and Gomory, E., 1964. Sequencing a one state-variable machine:A solvable case of the traveling salesman problem. Operations Research, 12 (5):655–679.
11. Grabowski, J., and Pempera, J., 2000. Sequencing ofjobs in some production system. European Journal of Operational Research, 125:535–550.
12. Gupta, J., 1988. Two-stage, hybrid flowshop scheduling problem. Journal Operations Research Social, 39:359–364.
13. Hall, N., and Sriskandarayah, C., 1996. A survey of machine scheduling problems with blocking and no-wait in process. Operations Research, 44:510–525.
14. Huang, R., Yang, C., and Huang, Y., 2009. No-wait two-stage multiprocessor flow shop scheduling with unit setup. International Journal of Advanced Manufacturing Technology, 44:921–927.
15. Jolai F., et al. A genetic algorithm for solving no-wait flexible flow lines with due window and job rejection International Journal of Advanced Manufacturing Technology 2009 42 523 532
16. Karimi, N., Zandieh, M., and Karamooz, H., 2010a. Biobjective group scheduling in hybrid flexible flow shop:A multi-phase approach. Expert Systems with Applications, 37:4024–4032.
17. Karimi, N., Zandieh, M., and Najafi, A., 2010b. Group scheduling in flexible flow shops:a hybridized approach of imperialist competitive algorithm and electromagnetic-like mechanism. International Journal of Production Research
18. Kennedy, J., and Eberhart, R., 1995. Particle swarm optimization. IEEE International Conference on Neural Networks, 4:1942–1948. In, [doi:10.1109/ICNN.1995.488968]
19. Kennedy, J., and Eberhart, R., 1997. “ A discrete binary version of the particle swarm algorithm ”. In World MultiConference on Systemics, Cybernetics and Informatics 4104–4109. In
20. Naderi B., et al. Modeling and scheduling open shops with sequence-dependent setup times to minimize total completion time International Journal Advanced Manufacturing Technology 2011a 53 751 760
21. Naderi B., et al. Scheduling open shops with parallel machines to minimize total completion time Journal of Computational and Applied Mathematics 2011b 235 1275 1287
22. Pan, Q., Tasgetiren, M., and Liang, Y., 2008. A discrete particle swarm optimization algorithm for the no-wait flow shop scheduling problem. Computers & Operations Research, 35:2807–2839.
23. Raaymakers, W., and Hoogeveen, J., 2000. Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing. European Journal of Operational Research, 126:131–151.
24. Reddi, S., and Ramamoorthy, C., 1972. On the flow shop sequencing problem with no-wait in process. Operational Research Quarterly, 23 (3):323–331.
25. 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, DOI:10.1080/0951192X.2011.597430
26. 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 (11):3087–3103.
27. Sriscandarajah, C., and Ladet, P., 1986. Some no-wait shops scheduling problems:Complexity aspects. European journal of Operational research, 24:424–445.
28. Zandieh, M., and Gholami, M., 2009. An immune algorithm for scheduling a hybrid flow shop with sequence-dependent setup times and machines with random breakdowns. International Journal of Production Research, 47 (24):6999–7027.
29. Zandieh, M., Fate Ghomi, S., and Moattar Husseini, S., 2006. An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times. Applied Mathematics and Computation, 180 (1):111–127.