A differential evolution algorithm for the no-idle flowshop scheduling problem with total tardiness criterion

International Journal of Production Research

Volumn 49, Issue 16, 2011, Pages 5033-5050

  Tasgetiren, M Fatih ^a   Pan, Quan Ke ^b   Suganthan, P N ^c   Jin Chua, Tay ^d  

^a YASAR UNIVERSITY   (Turkey)

^b LIAOCHENG UNIVERSITY   (China)

^c NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^d SINGAPORE INSTITUTE OF MANUFACTURING TECHNOLOGY   (Singapore)

Author keywords

differential evolution algorithm; heuristic optimisation; random key genetic algorithm; the no idle permutation flowshop scheduling problem

Indexed keywords

APPLICATION AREA; COMPUTATIONAL RESULTS; CONTINUOUS ALGORITHMS; DIFFERENTIAL EVOLUTION ALGORITHMS; EFFICIENT METHOD; FLOW SHOP SCHEDULING PROBLEM; GLOBAL OPTIMISATION; IDLE TIME; MAKESPAN; NO-IDLE; NO-IDLE CONSTRAINT; ON-MACHINES; OPTIMISATIONS; PERMUTATION FLOW SHOPS; PERMUTATION FLOW-SHOP SCHEDULING; RANDOM KEY GENETIC ALGORITHM; SCHEDULING PROBLEM; SEARCH PROCESS; SOLUTION APPROACH; SOLUTION QUALITY; TIME OF PROCESSING; TOTAL TARDINESS; VARIABLE PARAMETERS;

BIOLOGY; COMBINATORIAL OPTIMIZATION; GENETIC ALGORITHMS; GLOBAL OPTIMIZATION; OPTIMIZATION; SCHEDULING ALGORITHMS;

PARAMETER ESTIMATION;

EID: 79960512575     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207543.2010.497781     Document Type: Article

References (38)

1. Adiri, I. and Pohoryles, D., 1982. Flow-shop/no-idle or no-wait scheduling to minimize the sum of completion times. Naval Research Logistics Quarterly, 29 (3), 495-504.
2. Babu, B.V. and Onwubolu, G.C., eds., 2004. New optimization techniques in engineering. Berlin: Springer Verlag.
3. Babu, A., et al., 2010. Scheduling of machines and automated guided vehicles in FMS using differential evolution. International Journal of Production Research, 48 (16), 4683-4699.
4. Baptiste, P. and Hguny, L.K., 1997. A branch and bound algorithm for the F/no-idle/Cmax. Proceedings of the international conference on industrial engineering and production management (IEPM97), Lyon, France, 429-438.
5. Baraz, D. and Mosheiov, G., 2008. A note on a greedy heuristic for the flow-shop makespan minimisation with no machine idle-time. European Journal of Operational Research, 184 (2), 810-813. (Pubitemid 47374398)
6. Bean, J.C., 1994. Genetic algorithms and random keys for sequencing and optimization ORSA. Journal on Computing, 6 (2), 154-160.
7. Cepek, O., Okada, M., and Vlach, M., 2000. Note: On the two-machine no-idle flowshop problem. Naval Research Logistics, 47 (4), 353-358.
8. Chakraborty, U.K., ed. 2008. Advances in differential evolution. Berlin: Springer.
9. Corne, D., Dorigo, M., and Glover, F., eds, 1999. Part two: Differential evolution, new ideas in optimisation. London: McGraw-Hill, 77-158.
10. Dimopoulos, C. and Zalazala, A.M.S., 2000. Recent development in evolutionary computation for manufacturing optimization: Problems, solutions, and comparisons. IEEE Transactions on Evolutionary Computation, 4 (2), 93-113.
11. Framinan, J.M. and Leisten, R., 2008. Total tardiness minimization in permutation flow shops: A simple approach based on a variable greedy algorithm. International Journal of Production Research, 46 (22), 6479-6498.
12. Gämperle, R., Müller, S.D., and Koumoutsakos, P., 2002. A parameter study for differential evolution. Proceedings of WSEAS international conference on advances in intelligent systems, fuzzy systems and e-computing, 293-298.
13. Grabowski, J. and Pempera, J., 2005. Some local search algorithms for no-wait flow-shop problem with makespan criterion. Computers and Operations Research, 32 (8), 2197-2212.
14. Johnson, S.M., 1954. Optimal two-and three-stage production schedules with setup times included. Naval Research Logistics Quarterly, 1 (1), 61-68.
15. Hasija, S. and Rajendran, C., 2004. Scheduling in flowshops to minimize total tardiness of jobs. International Journal of Production Research, 42 (11), 2289-2301.
16. Kalczynski, P.J. and Kamburowski, J., 2005. A heuristic for minimizing the makespan in no-idle permutation flow shop. Computers and Industrial Engineering, 49 (1), 146-154. (Pubitemid 41084186)
17. Kalczynski, P.J. and Kamburowski, J., 2007. On no-wait and no-idle flow shops with makespan criterion. European Journal of Operational Research, 178 (3), 677-685. (Pubitemid 44765138)
18. Kamburowski, J., 2004. More on three-machine no-idle flow shops. Computers and Industrial Engineering, 46 (3), 461-466.
19. Lampinen, J., 2001. A bibliography of differential evolution algorithm. Technical Report. Lappeenranta University of Technology, Department of Information Technology, Laboratory of Information Processing.
20. Mladenovic, N. and Hansen, P., 1997. Variable neighbourhood search. Computers and Operations Research, 24 (11), 1097-1100.
21. Narain, L. and Bagga, P.C., 2003. Minimising total elapsed time subject to zero total idle time of machines in n-3 flowshop problem. Indian Journal of Pure and Applied Mathematics, 34 (2), 219-228. (Pubitemid 41449036)
22. Narain, L. and Bagga, P.C., 2005a. Flowshop/no-idle scheduling to minimize the mean flowtime. Anziam Journal, 47, 265-275. (Pubitemid 44238517)
23. Narain, L. and Bagga, P.C., 2005b. Flowshop/no-idle scheduling to minimise total elapsed time. Journal of Global Optimization, 33 (3), 349-367. (Pubitemid 41641501)
24. Nawaz, M., Enscore Jr, E.E., and Ham, I., 1983. A heuristic algorithm for the m-machine, n-job flow shop sequencing problem. OMEGA, 11 (1), 91-95. (Pubitemid 13193807)
25. Osman, I.H. and Potts, C.N., 1989. Simulated annealing for permutation flow shop scheduling. OMEGA, 17 (6), 551-557.
26. Pan, Q.-K. and Wang, L., 2008a. A novel differential evolution algorithm for no-idle permutation flowshop scheduling problems. European Journal of Industrial Engineering, 2 (3), 279-297. (Pubitemid 351486195)
27. Pan, Q.-K. and Wang, L., 2008b. No-idle permutation flow shop scheduling based on a hybrid discrete particle swarm optimization algorithm. International Journal of Advanced Manufacturing Technology, 39 (7), 796-807.
28. Price, K., Storn, R., and Lampinen, J., 2006. Differential evolution -A practical approach to global optimisation. Berlin: Springer-Verlag.
29. Qian, B., et al., 2009. An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers. International Journal of Production Research, 47 (1), 1-24.
30. Reza Hejazi, S. and Saghafian, S., 2005. Flowshop-scheduling problems with makespan criterion: A review. International Journal of Production Research, 43 (14), 2895-2929. (Pubitemid 41657440)
31. Rönkkönen, J., Kukkonen, S., and Price, K., 2005. Real-parameter optimization with differential evolution. Proceedings of the 2005 IEEE congress on evolutionary computing, 2-4 September, Edinburgh, UK, 506-513.
32. Ruiz, R. and Maroto, C., 2005. A comprehensive review and evaluation of flowshop heuristics. European Journal of Operational Research, 165 (2), 479-494. (Pubitemid 40206377)
33. Ruiz, R. and Stützle, T., 2006. An iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives. European Journal of Operational Research, 177 (3), 1143-1159. (Pubitemid 350245722)
34. Ruiz, R. and Stutzle, T., 2007. A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research, 177 (3), 2033-2049. (Pubitemid 44712036)
35. Ruiz, R., Vallada, E., and Fernandez-Martinez, C., 2009. Scheduling in flowshops with no-idle machines. In: U.K. Chakraborthy, ed. Computational intelligence in flowshop and job shop scheduling. Berlin, Heidelberg: Springer-Verlag.
36. Saadani, N.E.H., Guinet, A., and Moalla, M., 2001. A travelling salesman approach to solve the F/no-idle/Cmax problem. Proceedings of the international conference on industrial engineering and production management (IEPM01), vol. 2, Quebec, Canada, 880-888.
37. Saadani, N.E.H., Guinet, A., and Moalla, M., 2003. Three stage no-idle flow-shops. Computers and Industrial Engineering, 44 (3), 425-434.
38. Saadani, N.E.H., Guinet, A., and Moalla, M., 2005. A travelling salesman approach to solve the F/no-idle/Cmax problem. European Journal of Operational Research, 161 (1), 11-20.