Hybrid firefly-simulated annealing algorithm for the flow shop problem with learning effects and flexible maintenance activities

International Journal of Production Research

Volumn 51, Issue 12, 2013, Pages 3501-3515

  Vahedi Nouri, Behdin ^a   Fattahi, Parviz ^a   Ramezanian, Reza ^b  

^a BU ALI SINA UNIVERSITY   (Iran)

^b IRAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Iran)

Author keywords

availability constraint; heuristic method; hybrid firefly simulated annealing algorithm; learning effect; non permutation flow shop; scheduling; Taguchi method

Indexed keywords

ANNEALING ALGORITHM; AVAILABILITY CONSTRAINTS; COMPUTATIONAL RESULTS; FLOW SHOP SCHEDULING PROBLEM; FLOW-SHOPS; LEARNING EFFECTS; MIXED INTEGER LINEAR PROGRAMMING MODEL; SIMULATED ANNEALING ALGORITHMS;

BIOLUMINESCENCE; HEURISTIC ALGORITHMS; HEURISTIC METHODS; INDUSTRIAL MANAGEMENT; LINEAR PROGRAMMING; MACHINE SHOP PRACTICE; PREVENTIVE MAINTENANCE; TAGUCHI METHODS;

SCHEDULING;

EID: 84880246100     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207543.2012.750771     Document Type: Article

References (34)

1. Aggoune, R., and M.-C. Portmann. 2006. "Flow shop scheduling problem with limited machine availability: A heuristic approach." International Journal of Production Economics 99 (1-2): 4-15
2. Aggoune, R. 2004. "Minimizing the makespan for the flow shop scheduling problem with availability constraints." European Journal of Operational Research 153 (3): 534-543
3. Aldowaisan, T.A., and A. Allahverdi. 2012. "No-wait flowshop scheduling problem to minimize the number of tardy jobs." International Journal of Advanced Manufacturing Technology 61 (1-4): 311-323
4. Bank, M., S.M.T. Fatemi Ghomi, F. Jolai, and J. Behnamian. 2012. "Application of particle swarm optimization and simulated annealing algorithms in flow shop scheduling problem under linear deterioration." Advances in Engineering Software 47 (1): 1-6
5. Ben Chihaoui, F., I. Kacem, A.B. Hadj-Alouane, N. Dridi, and N. Rezg. 2011. "No-wait scheduling of a two-machine flow-shop to minimize the makespan under non-Availability constraints and different release dates." International Journal of Production Research 49 (21): 6273-6286
6. Biskup, D. 1999. "Single-machine scheduling with learning considerations." European Journal of Operational Research 115 (1): 173-178
7. Biskup, D. 2008. "A state-Of-The-Art review on scheduling with learning effects." European Journal of Operational Research 188 (2): 315-329
8. Cheng, T.C.E., C.-C. Wu, and W.-C. Lee. 2008. "Some scheduling problems with deteriorating jobs and learning effects." Computers and Industrial Engineering 54 (4): 972-982
9. Chung, Y.-H., and L.-I. Tong. 2011. "Makespan minimization for m-machine permutation flowshop scheduling problem with learning considerations." International Journal of Advanced Manufacturing Technology 56 (1-4): 355-367
10. Garey, M.R., D.S. Johnson, and R. Sethi. 1976. "The complexity of flowshop and jobshop scheduling." Mathematics of Operations Research 1 (2): 117-129
11. Ghodratnama, A., M. Rabbani, R. Tavakkoli-Moghaddam, and A. Baboli. 2010. "Solving a single-machine scheduling problem with maintenance, job deterioration and learning effect by simulated annealing." Journal of Manufacturing Systems 29 (1): 1-9
12. Graham, R.L., E.L. Lawler, J.K. Lenstra, and K.A. Rinnooy. 1979. "Optimization and approximation in deterministic sequencing and scheduling: A survey." Annuals of Operations Research 5: 287-326
13. Kirkpatrick, S., C.D. Gelatt, and M.P. Vecchi. 1983. "Optimization by simulated annealing." Science 220 (4598): 671-680
14. Lee, W.-C., and C.-C. Wu. 2009. "Some single-machine and m-machine flowshop scheduling problems with learning considerations." Information Sciences 179 (22): 3885-3892
15. Lin, S.-W., and K.-C. Ying. 2009. "Applying a hybrid simulated annealing and tabu search approach to non-permutation flowshop scheduling problems." International Journal of Production Research 47 (5): 1411-1424
16. Ma, Y., C. Chu, and C. Zuo. 2010. "A survey of scheduling with deterministic machine availability constraints." Computers and Industrial Engineering 58 (2): 199-211
17. Nawaz, M., E.E. Enscore, and I. Ham. 1983. "A heuristic algorithm for the m-machine, n-job flowshop sequencing problem." Omega 11: 91-95
18. Osman, I., and C. Potts. 1989. "Simulated annealing for permutation flow-shop scheduling." Omega 17 (6): 551-557
19. Panwalkar, S.S., and W. Iskander. 1977. "A survey of scheduling rules." Operations Research 25: 45-61
20. Perez-Gonzalez, P., and J. Framinan. 2009. "Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics." Computers and Operations Research 36 (10): 2866-2876
21. Phadke, M.S. 1989. Quality engineering using robust design. Upper Saddle River: Prentice-Hall
22. Safari, E., and S.J. Sadjadi. 2011. "A hybrid method for flowshops scheduling with condition-based maintenance constraint and machines breakdown." Expert Systems with Applications 38 (3): 2020-2029
23. Sayadi, M.K., R. Ramezanian, and N. Ghaffari-Nasab. 2010. "A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems." Int. J. of Industrial Engineering Computations 1 (1): 1-10
24. Schmidt, G. 2000. "Scheduling with limited machine availability." European Journal of Operational Research 121 (1): 1-15
25. Wang, J.-B., and M.-Z. Wang. 2012. "Worst-case analysis for flow shop scheduling problems with an exponential learning effect." Journal of the Operational Research Society 63 (1): 130-137
26. Wang, J.-B., and Z.-Q. Xia. 2005. "Flow-shop scheduling with a learning effect." Journal of the Operational Research Society 56: 1325-1330
27. Wang, J.-B. 2006. "A note on scheduling problems with learning effects and deteriorating jobs." International Journal of Systems Science 37 (12): 827-833
28. Wu, C.-C., and W.-C. Lee. 2007. "A note on single-machine scheduling with learning effect and an availability constraint." International Journal of Advanced Manufacturing Technology 33 (5-6): 540-544
29. Wu, C.-C., and W.-C. Lee. 2009a. "A note on the total completion time problem in a permutation flowshop with a learning effect." European Journal of Operational Research 192 (1): 343-347
30. Wu, C.-C., and W.-C. Lee. 2009b. "Single-machine and flowshop scheduling with a general learning effect model." Computers and Industrial Engineering 56 (4): 1553-1558
31. Wua, C.-C., J.-C. Chenb, W.-H. Wuc, P.-H. Hsua, and W.-H. Wud. 2011. "Simulated annealing algorithms for the two-machine makespan flowshop scheduling with truncated learning consideration." International Journal of Industrial Engineering: Theory Applications and Practice 18 (8): 432-443
32. Yang, S.-J. 2010. "Single-machine scheduling problems with both start-Time dependent learning and position dependent aging effects under deteriorating maintenance consideration." Applied Mathematics and Computation 217 (7): 3321-3329
33. Yang, X.S., 2008. Nature-inspired metaheuristic algorithms. Luniver Press. Yang, X.-S. 2009. "Firefly algorithms for multimodal optimization." Stochastic Algorithms: Foundations and Applications, SAGA, Lecture Notes in Computer Sciences 5792: 169-178
34. Yin, Y., D. Xu, K. Sun, and H. Li. 2009. "Some scheduling problems with general position-Dependent and time-Dependent learning effects." Information Sciences 179 (14): 2416-2425