A novel differential evolution algorithm for no-idle permutation flow-shop scheduling problems

European Journal of Industrial Engineering

Volumn 2, Issue 3, 2008, Pages 279-297

  Pan, Quan Ke ^a   Wang, Ling ^b  

^a LIAOCHENG UNIVERSITY   (China)

^b TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; EVOLUTIONARY ALGORITHMS; HEURISTIC METHODS; PARTICLE SWARM OPTIMIZATION (PSO); SCHEDULING;

DIFFERENTIAL EVOLUTION ALGORITHM; DISCRETE DIFFERENTIAL EVOLUTION (DDE); FLOW-SHOP SCHEDULING PROBLEMS; JOB PERMUTATIONS;

JOB ANALYSIS;

EID: 41749107959     PISSN: 17515254     EISSN: 17515262     Source Type: Journal    
DOI: 10.1504/EJIE.2008.017687     Document Type: Article

References (36)

1. Adiri, I. and Pohoryles, D. (1982) 'Flow- shop/no-idle or no-wait scheduling to minimize the sum of completion times', Naval Research Quarterly, Vol. 29, pp.495-504.
2. Baptiste, P. and Lee, K.H. (1997) 'A branch and bound algorithm for the F no-idle Cmax', Proceedings of the International Conference on Industrial Engineering and Production Management (IEPM'1997), Lyon, Vol. 1, pp.429-438.
3. Baraz, D. and Mosheiov, G. (2007) 'A note on a greedy heuristic for the flow-shop makespan minimization with no machine idle-time', Eur J Oper Res, doi: 10.1016/j.ejor.2006.11.025.
4. Chandrasekaran, C., Rajendran, C., Chetty, K.O.V., et al. (2007) 'Metaheuristics for solving Economic Lot Scheduling Problems (ELSP) using time-varying lot-sizes approach', European Journal of Industrial Engineering, Vol. 1, pp. 158-181.
5. Chang, F.P. and Hwang, C. (2004) 'Design of digital PID controllers for continuous-time plants with integral performance criteria', J Chin Inst Chem Eng, Vol. 35, pp.683-696.
6. Christofides, N., Mingozzi, A., Toth, P., et al. (1979) 'The traveling salesman problem', Combinatorial Optimisation, John Wiley and Sons.
7. Dimopoulos, C. and Zalazala, A.M.S. (2000) 'Recent development in evolutionary computation for manufacturing optimization: Problems, solutions, and comparisons', IEEE Trans Evolut Comput, Vol. 4, pp.93-113.
8. Grabowski, J. and Pempera, J. (2005) 'Some local search algorithms for no-wait flow-shop problem with makespan criterion', Comput Oper Res Vol. 32, pp.2197-2212.
9. Hmida, A.B., Huguet, M.J., Lopez, P., et al. (2007) 'Climbing depth-bounded discrepancy search for solving hybrid flow shop problems', European Journal of Industrial Engineering, Vol. 1, pp.223-243.
10. Ilonen, J., Kamarainen, J.K. and Lampinen, J. (2003) 'Differential evolution training algorithm for feed-forward neural networks', Neural Process Lett, Vol. 17, pp.93-105.
11. Johnson, S.M. (1954) 'Optimal two- and three-stage production schedules with setup times included', Naval Research Logistics Quarterly, Vol. 1, pp.61-68.
12. Kalczynski, P.J. and Kamburowski, J. (2005) 'A heuristic for minimizing the makespan in no-idle permutation flow shop', Computers & Industrial Engineering, Vol. 49, pp. 146-154.
13. Kalczynski, P.J. and Kamburowski, J. (2007) 'On no-wait and no-idle flow shops with makespan criterion', Eur J Oper Res, Vol. 178, pp.677-685.
14. Kamburowski, J. (2004) 'More on three-machine no-idle flow shops', Computers & Industrial Engineering, Vol. 46, pp.461-466.
15. Li, B.B. and Wang, L. (2007) 'A hybrid quantum-inspired genetic algorithm for multiobjective flow shop scheduling', IEEE Trans Syst, Man and Cybern, B, Cybern, Vol. 37, pp.576-591.
16. Liu, B., Wang, L. and Jin, Y.H. (2007) 'An effective hybrid particle swarm optimization for no-wait flow shop scheduling', Int J Ada Manuf Technol, Vol. 31, pp.1001-1011.
17. Narain, L. and Bagga, P.C. (2005) 'Flowshop/No-idle scheduling to minimize total elapse time', Journal of Global Optimization, Vol. 33, pp.349-367.
18. Nawaz, M., Enscore, E.E.J. and Ham, I. (1983) 'A heuristic algorithm for the m-machine, n-job flow shop sequencing problem', OMEGA, Vol. 11, pp.91-95.
19. Onwubolu, G.C. and Davendra, D. (2006) 'Scheduling flow shops using differential evolution algorithm', Eur J Oper Res, Vol. 171, No. 2, pp.674-692.
20. Osman, I. and Potts, C. (1989) 'Simulated annealing for permutation flow shop scheduling', OMEGA, Vol. 17, pp.551-557.
21. Pan,Q.K., Tasgetiren, M.F. and Liang, Y.C. (2006) 'Minimizing total earliness and tardiness penalties with a common due date on a single-machine using a discrete particle swarm optimization algorithm', LNCS, Vol. 4150, pp.460-467.
22. Pan, Q.K., Tasgetiren, M.F. and Liang, Y.C. (2007) 'A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem', Comput Oper Res, doi:10.1016/j.cor.2006.12.030.
23. Qian, B., Wang, L., Hu, R., et al. (2007) 'A hybrid differential evolution for permutation flow-shop scheduling', Int J Ada Manuf Technol, doi: 10.1007/s00170-007-1115-8.
24. Ruiz, R. and Stutzle, T. (2007) 'A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem', Eur J Oper Res, Vol. 177, pp.2033-2049.
25. Ruzek, B. and Kvasnicka, M. (2001) 'Differential evolution in the earthquake hypocenter location', Pure and Applied Geophysics, Vol. 158, pp.667-693.
26. Saadani, H., Baptisete, P. and Moalla, M. (2005a) 'The simple F2//Cmax with forbidden tasks in first or last position: A problem more complex than it seems', Eur J Oper Res, Vol. 161, pp.21-31.
27. Saadani, H., Guinet, A. and Moalla, M. (2001) 'A traveling salesman approach to solve the F/no-idle/Cmax problem', Proceedings of the International Conference on Industrial Engineering and Production Management (IEPM'2001), Quebec, Vol. 2, pp.880-888.
28. Saadani, H., Guinet, A. and Moalla, M. (2003) 'Three stage no-idle flow-shops', Computers & Industrial Engineering, Vol. 44, pp.425-434.
29. Saadani, H., Guinet, A. and Moalla, M. (2005b) 'A traveling salesman approach to solve the F/no-idle/Cmax problem', Eur J Oper Res, Vol. 161, pp. 11-20.
30. Storn, R. (1999) 'Designing digital filters with differential evolution', in D. Corne, M. Dorigo and F. Glover (Eds.) New Ideas in Optimization, London, UK: McGraw-Hill, pp. 109-125.
31. Storn, R. and Price, K. (1997) 'Differential evolution - a simple and efficient adaptive scheme for global optimization over continuous spaces', Journal of Global Optimization, Vol. 11, pp.341-359.
32. Taillard, E. (1990) 'Some efficient heuristic methods for the flow shop sequencing problems', Eur J Oper Res, Vol. 47, pp.65-74.
33. Taillard, E. (1993) 'Benchmarks for basic scheduling problems', Eur J Oper Res, Vol. 64, pp.278-285.
34. Tasgetiren, M.F., Pan, Q.K., Suganthan, P.N., et al. (2007) 'A discrete differential evolution algorithm for the no-wait flowshop problem with total flowtime criterion', Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, pp.251-258.
35. Tasgetiren, M.F., Sevkli, M., Liang, Y.C., et al. (2006) 'A particle swarm optimization and differential algorithm for job shop scheduling problem', International Journal of Operations Research, Vol. 3, pp.120-135.
36. Wang, L. (2001) Intelligence Optimization Algorithm with Applications Beijing, China: Tsinghua Univ Press.