Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups

Computers and Industrial Engineering

Volumn 48, Issue 3, 2005, Pages 491-506

  França, Paulo M ^a   Gupta, Jatinder N D ^b   Mendes, Alexandre S ^d   Moscato, Pablo ^d   Veltink, Klaas J ^c  

^a UNIVERSITY OF CAMPINAS   (Brazil)

^b UNIVERSITY OF ALABAMA IN HUNTSVILLE   (United States)

^c UNIVERSITY OF GRONINGEN   (Netherlands)

^d UNIVERSITY OF NEWCASTLE   (Australia)

Author keywords

Empirical results; Evolutionary algorithms; Family sequence dependent setups; Flowshop scheduling; Group technology; Manufacturing cells

Indexed keywords

COMPUTER SIMULATION; GENETIC ALGORITHMS; GROUP TECHNOLOGY; MATHEMATICAL MODELS; PROBLEM SOLVING; PRODUCTIVITY; SCHEDULING;

EMPIRICAL RESULTS; FAMILY SEQUENCE DEPENDENT SETUPS; FLOWSHOP SCHEDULING; MEMETIC ALGORITHMS;

CELLULAR MANUFACTURING;

EID: 14644435008     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2003.11.004     Document Type: Conference Paper

References (13)

1. A. Allahverdi, J.N.D. Gupta, and T. Aldowaisan A survey of scheduling research involving setup considerations, OMEGA International Journal of Management Science 27 1999 219 239
2. E.H.L. Aarts, P.J.M. Van Laarhoven, J.K. Lenstra, and N.L.J. Ulder A computational study of local search algorithms for job shop scheduling ORSA Journal on Computing 6 1994 118 125
3. T.C.E. Cheng, J.N.D. Gupta, and G. Wang A review of flowshop scheduling research with setup times Production and Operations Management 9 2000 283 302
4. D. Corne, F. Glover, and M. Dorigo New ideas in optimisation 1999 McGraw-Hill New York
5. C.A. Glass, and C.N. Potts A comparison of local search methods for flow shop scheduling Annals of Operations Research 63 1996 489 509
6. Gorges-Schleuter, M. (1997). Asparagos96 and the traveling salesman problem. Proceedings of 1997 IEEE international conference on evolutionary computation - ICEC'97, Indianapolis, USA (pp. 171-174).
7. J.N.D. Gupta, and W.P. Darrow The two-machine sequence dependent flowshop scheduling problem European Journal of Operational Research 24 1986 439 446
8. Hart, W. E., Baden, S., Belew, R. K, & Kohn, S. (1996). Analysis of the numerical effects of parallelism on a parallel genetic algorithm. Proceedings of 10th international parallel processing symposium - IPPS'96, Honolulu, USA (pp. 606-612).
9. K. Hitomi, N. Nakamura, T. Yoshida, and K. Okuda An experimental investigation of group production scheduling Proceedings of the fourth international conference on production research, Tokyo 1977 608 617
10. Mendes, A. S., Muller, F. M., França, P. M., & Moscato, P. (1999). Comparing meta-heuristic approaches for parallel machine scheduling problems with sequence-dependent setup times. Proceedings of the 15th international conference on CAD/CAM robotics and factories of the future, Àguas de Lindòia, SP, Brazil.
11. Moscato, P. (1989). On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms. Caltech Concurrent Computation Program, C3P Report 1989 826.
12. N.J. Radcliffe Formal memetic algorithms T.C. Fogarthy Evolutionary computing: AISB workshop 1994 Springer New York 1 16
13. J.E. Schaller, J.N.D. Gupta, and A.J. Vakharia Scheduling a flowline manufacturing cell with sequence dependent family setup times European Journal of Operations Research 125 2000 324 339