A discrete differential evolution algorithm for the no-wait flowshop scheduling problem with total flowtime criterion

Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2007

Volumn , Issue , 2007, Pages 251-258

  Tasgetiren, M Fatih ^a   Pan, Quan Ke ^b   Suganthan, P N ^c   Liang, Yun Chia ^d  

^a SULTAN QABOOS UNIVERSITY   (Oman)

^b LIAOCHENG UNIVERSITY   (China)

^c NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^d YUAN ZE UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; PROBLEM SOLVING; QUALITY OF SERVICE; SCHEDULING;

DISCRETE DIFFERENTIAL EVOLUTION; FLOWSHOP SCHEDULING PROBLEM; OPTIMAL SOLUTION; VARIABLE NEIGHBORHOOD DESCENT (VND);

EVOLUTIONARY ALGORITHMS;

EID: 34548751673     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SCIS.2007.367698     Document Type: Conference Paper

References (29)

1. Taillard E. Benchmarks for basic scheduling problems, European Journal of Operational Research, 1993, 64, 278-285.
2. Fink A, Voß S. Solving the continuous flow-shop scheduling problem by metaheuristics. European Journal of Operational Research 2003;151:400-14.
3. Rajendran C. A no-wait flowshop scheduling heuristic to minimize makespan. Journal of the Operational Research Society 1994;45:472-8.
4. Hall NG, Sriskandarayah C. A survey of machine scheduling problems with blocking and no-wait in process. Operations Research 1996; 44:510-25.
5. Grabowski J., Pempera J. Sequencing of jobs in some production system. European Journal of Operational Research 2000;125:535-50.
6. Raaymakers W, Hoogeveen J. Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing, European Journal of Operational Research 2000; 126:131-51.
7. Garey MR, Johnson DS. Computers and intractability: A guide to the theory of NP-completeness. Freeman, San Francisco, 1979.
8. Bonney MC, Gundry SW. Solutions to the constrained flowshop sequencing problem. Operational Research Quarterly 1976;24:869-83.
9. King JR, Spachis AS. Heuristics for flowshop scheduling. International Journal of Production Research 1980; 18:343-57.
10. Gangadharan R, Rajedran C Heuristic algorithms for scheduling in no-wait flowshop. International Journal of Production Economics 1993;32:285-90.
11. Rajendran C, Chaudhuri D. Heuristic algorithms for continuous flow-shop problem. Naval Research Logistics 1990, 37, 695-705.
12. Aldowaisan T, Allahverdi A. New heuristics for no-wait flowshops to minimize makespan. Computers and Operations Research 2003;30:1219-31.
13. Schuster C J, Framinan J M. Approximative procedure for no-wait job shop scheduling. Operations Research Letters 2003;31:308-18.
14. Grabowski J, Pempera J. Some local search algorithms for no-wait flow-shop problem with makespan criterion. Computers and Operations Research 2005; 32:2197-212.
15. Chen C-L, Neppalli R V, Aljaber N. Genetic algorithms applied to the continuous flowshop problem. Computers and Industrial Engineering, 1996, 30, 919-929.
16. Pan Q-K, Tasgetiren M. F, Liang Y-C, 2005, "A Discrete Particle Swarm Optimization Algorithm for the No-Wait Flowshop Scheduling Problem with Makespan and Total Flowtime Criteria", Accepted to "Bio-inspired metaheuristics for combinatorial optimization problems". Special issue of Computers & Operations Research, 2005.
17. Storn, R. and Price, K. (1995) "Differential Evolution - a Simple and Efficient Adaptive Scheme for Global Optimization over Continuous Spaces," Technical Report TR-95-012, ICSI, 1995.
18. Storn, R. and Price, K. (1997) "Differential Evolution - A Simple and Efficient Heuristic for Global Optimization over Continuous Space," Journal of Global Optimization, vol. 11, pp. 341-359.
19. Corne, D., Dorigo, M., and Glover, F. (eds.) (1999) "Part Two: Differential Evolution, " New Ideas in Optimization, McGraw-Hill, pp. 77-158.
20. Lampinen, J. (2001) "A Bibliography of Differential Evolution Algorithm," Technical Report, Lappeenranta University of Technology, Department of Information Technology, Laboratory of Information Processing.
21. Babu, B. V. and Onwubolu, G. C. (eds.) (2004) New Optimization Techniques in Engineering, Springer Verlag.
22. Price, K., Storn, R., and Lampinen, J. (2006) Differential Evolution - A Practical Approach to Global Optimization, Springer-Verlag.
23. Nawaz M, Enscore E. E Jr., Ham I, A heuristic algorithm for the m-machine, n-job flow shop sequencing problem, OMEGA 11(1), (1983) 91-95.
24. Mladenovic N, Hansen P, Variable neighborhood search, Computers and Operations Research 24 (1997) 1097-1100.
25. Tasgetiren M. F., Yun-Chia Liang, Sevkli M., Gencyilmaz G, Particle Swarm Optimization Algorithm for Makespan and Total Flowtime Minimization in Permutation Flowshop Sequencing Problem, European Journal of Operational Research, 2005, in press.
26. Watson J P, Barbulescu L, Whitley L D, Howe A E, Contrasting structured and random permutation flowshop scheduling problems: search space topology and algorithm performance, ORSA Journal of Computing 14(2) (2002) 98-123.
27. I. Osman, C. Potts, Simulated annealing for permutation flow shop scheduling, OMEGA 17(6) (1989) 551-557.
28. Fink A, Voß S. HotFrame: Aheuristic optimization framework, in: Voß S., Woodruff D (Eds), Optimization Software Class Libraries. Kluwer, Boston, 2002, pp. 81-154.
29. Picard J-C, Queyranne M. The time dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling. Operations Research, 1978, 26, 86-110.