A hybrid water flow algorithm for multi-objective flexible flow shop scheduling problems

Engineering Optimization

Volumn 45, Issue 4, 2013, Pages 483-502

  Tran, Trung Hieu ^a   Ng, Kien Ming ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

flexible flow shop scheduling; metaheuristics; multi objective optimization; nature inspired optimization; water flow algorithm

Indexed keywords

COMPUTATIONAL RESULTS; EFFECTIVENESS AND EFFICIENCIES; FLEXIBLE FLOW SHOP; INTERMEDIATE BUFFERS; META HEURISTICS; OBJECTIVE FUNCTIONS; PRECIPITATION PROCESS; WATER FLOW ALGORITHMS;

ALGORITHMS; BENCHMARKING; COMPUTATIONAL EFFICIENCY; FLOW OF WATER; HYDRAULICS; MACHINE SHOP PRACTICE; MULTIOBJECTIVE OPTIMIZATION; SCHEDULING;

PROBLEM SOLVING;

EID: 84876113744     PISSN: 0305215X     EISSN: 10290273     Source Type: Journal    
DOI: 10.1080/0305215X.2012.685072     Document Type: Article

References (25)

1. Afshar, A., Sharifi, F., and Jalali, M.R., 2009. Non-dominated archiving multi-colony ant algorithm for multi-objective optimization: application to multi-purpose reservoir operation. Engineering Optimization, 41 (4), 313-325.
2. Akturk, M.S. andYildirim, M.B., 1998.Anewlower bounding scheme for the total weighted tardiness problem. Computers and Operations Research, 25 (4), 265-278.
3. Garey, M.R., Johnson, D.S., and Sethi, R., 1976. The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1 (2), 117-129.
4. Ishibuchi, H.,Yoshida,T., and Murata,T 2003. Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling IEEE Transactions on Evolutionary Computation 7 2 204-223.
5. Knowles, J.D. and Corne, D.W., 2002. On metrics for comparing nondominated sets. In: Proceedings of congress on evolutionary computation (CEC'02), 12-17 May 2002 Honolulu, HI, USA, pp. 711-716.
6. Kotinis, M., 2011. Implementing co-evolution and parallelization in a multi-objective particle swarm optimizer. Engineering Optimization, 43 (6), 635-656.
7. Lei, D., 2009. Multi-objective production scheduling: a survey. International Journal of Advanced Manufacturing Technology, 43 (9-10), 926-938.
8. McCormick, S.T., et al., 1989. Sequencing in an assembly line with blocking to minimize cycle time. Operations Research, 37 (6), 925-936.
9. Pinedo, M., 2005. Planning and scheduling in manufacturing and services. NewYork: Springer.
10. Qian, B., et al., 2009. An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers. Computers and Operations Research, 36 (1), 209-233.
11. Quadt, D. and Kuhn, H., 2007.A taxonomy of flexible flow line scheduling procedures. European Journal of Operational Research, 178 (3), 686-698.
12. Rahimi-Vahed, A.R., et al., 2008.A multi-objective scatter search for a bi-criteria no-wait flow shop scheduling problem. Engineering Optimization, 40 (4), 331-346.
13. Rashidi, E., Jahandar, M., and Zandieh, M., 2010. An improved hybrid multi-objective parallel genetic algorithm for hybrid flow shop scheduling with unrelated parallel machines. International Journal of Advanced Manufacturing Technology, 49 (9-12), 1129-1139.
14. Ravindran, D., et al., 2005. Flow shop scheduling with multiple objective of minimizing makespan and total flow time. International Journal of Advanced Manufacturing Technology, 25 (9-10), 1007-1012.
15. Ribas, I., Leisten, R., and Framinan, J.M., 2010. Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective. Computers and Operations Research, 37 (8), 1439-1454.
16. Sawik, T., 2001. Mixed integer programming for scheduling surface mount technology lines. International Journal of Production Research, 39 (14), 3219-3235.
17. Shah-Hosseini, H., 2007. Problem solving by intelligent water drops. In: Proceedings of IEEE congress on evolutionary computation (CEC'07), 25-28 September 2007 Singapore, pp. 3226-3231.
18. Silva, J.D.L., Burke, E.K., and Petrovic, S., 2004. An introduction to multiobjective metaheuristics for scheduling and timetabling. In: Lecture notes in economics and mathematical systems, Vol. 535. Berlin: Springer, pp. 91-129.
19. Tang, L.X. and Xuan, H., 2006. Lagrangian relaxation algorithms for real-time hybrid flowshop scheduling with finite intermediate buffers. Journal of the Operational Research Society, 57 (3), 316-324.
20. Tantar, E., et al., 2008. A priori landscape analysis in guiding interactive multi-objective metaheuristics. In: Proceedings of IEEE congress on evolutionary computation (CEC'08), 1-6 June 2008 Hong Kong, pp. 4104-4111.
21. Tawatchai, K. and Sujin, B., 2011. Multi-objective topology optimization using evolutionary algorithms. Engineering Optimization, 43 (5), 541-557.
22. Tran, T.H. and Ng, K.M., 2011. A water-flow algorithm for flexible flow shop scheduling with intermediate buffers. Journal of Scheduling, 14 (5), 483-500.
23. Van Veldhuizen, D.A., 1999. Multiobjective evolutionary algorithms: classifications, analyses, and new innovations. Thesis (PhD). Department of Electrical and Computer Engineering, Air Force Institute of Technology, Wright-Patterson AFB, Ohio, USA.
24. Wardono, B. and Fathi,Y., 2004.A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities. European Journal of Operational Research, 155 (2), 380-401.
25. Wittrock, R.J., 1988. An adaptable scheduling algorithm for flexible flow lines. Operations Research, 36 (3), 445-453.