A two-criteria objective function flexible flowshop scheduling problem with machine eligibility constraint

International Journal of Advanced Manufacturing Technology

Volumn 64, Issue 5-8, 2013, Pages 1001-1015

  Tadayon, Bita ^a   Salmasi, Nasser ^a  

^a SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

Flexible flowshop scheduling; Group processing; Machine eligibility constraint; Mathematical modeling; Particle swarm optimization; Scheduling

Indexed keywords

A-PARTICLES; CERAMIC TILE; COMPLETION TIME; DELIVERY TIME; DIFFERENT SIZES; EXPERIMENTAL DESIGN TECHNIQUES; FLEXIBLE FLOWSHOP; GROUP PROCESSING; LARGE-SIZED; LOCAL SEARCH; MACHINE ELIGIBILITY CONSTRAINT; NP COMPLETE; OBJECTIVE FUNCTIONS; PSO ALGORITHMS; RANDOM TESTS; RELEASE TIME; RESEARCH PROBLEMS; SERVICE INDUSTRIES;

ALGORITHMS; MATHEMATICAL MODELS; PARTICLE SWARM OPTIMIZATION (PSO); SCHEDULING;

PROBLEM SOLVING;

EID: 84873741781     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-012-4052-0     Document Type: Article

References (19)

1. Graves SC (1981) A review of production scheduling. Oper Res 29(4):646-675
2. Reisman A, Kumar A, Motwani J (1997) Flowshop scheduling/sequencing research: a statistical review of the literature, 1952-1994. IEEE Trans Eng Manag 44(3):316-329
3. Pinedo M (2008) Scheduling theory, algorithms, and systems, 3rd edn. Springer LLC, New York
4. Ruiz R, Maroto C (2006) A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility. Eur J Oper Res 169(3):781-800
5. Salvador MS (1973) A solution to a special class of flow shop scheduling problems. In: Elmaghraby SE (ed) Symposium of the theory of scheduling and applications. Springer, Berlin, pp 83-91
6. Ribas I, Leisten R, Framinan JM (2010) Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective. Comput Oper Res 37:1439-1454
7. Ruiz R, Vázquez-Rodríguez JA (2010) The hybrid flow shop scheduling problem. Eur J Oper Res 205:1-18
8. Karimi N, Zandieh M, Karamooz HR (2010) Bi-objective group scheduling in hybrid flexible flowshop: a multi-phase approach. Expert Syst Appl 37:4024-4032
9. Massami E, Jin ZH (2011) Optimization of container terminal unloading operations based upon multistage flexible flowshop scheduling. Appl Mech Mater 97-98:633-639
10. Tseng CT, Liao CJ (2008) A particle swarm optimization algorithm for hybrid flowshop scheduling with multiprocessor tasks. Int J Prod Res 46(17):4655-4670
11. Ruiz R, Serifoglu FS, Urlings T (2008) Modeling realistic hybrid flexible flowshop scheduling problems. Comput Oper Res 35(4):1151-1175
12. Sawik T (2002) An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers. Math Comput Model 36(4-5):461-471
13. Allaoui H, Artiba A (2004) Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints. Comput Ind Eng 47(4):431-450
14. Cheng JL, Karuno Y, Kise H (2001) A shifting bottleneck approach for a parallel machine flowshop scheduling problem. J Oper Res Soc Jpn 44(2):140-156
15. Liao CJ, Tseng CT, Luarn P (2007) A discrete version of particle swarm optimization for flowshop scheduling problems. Comput Oper Res 34:3099-3111
16. Hajinejad D, Salmasi N, Mokhtari R (2011) A fast hybrid particle swarm optimization algorithm for flow shop sequence dependent group scheduling problem. Scientia Iranica 18:759-764. doi: 10.1016/j.scient.2011.05.023
17. Kennedy J, Eberhart RC (1995) Particle swarm optimization. Proc IEEE Int Conf Neural Netw Piscataway IEEE 4:1942-1948
18. Poli R, Kennedy J, Blackwell T (2007) Particle swarm optimization: an overview. Swarm Intell 1:33-57
19. Salmasi N (2005) Multi-stage group scheduling problems with sequence dependent setups. PhD Dissertation, Oregon State University, Corvallis, USA