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

Computers & Industrial Engineering - Tập 48 - Trang 491-506 - 2005
Paulo M. França1, Jatinder N.D. Gupta2, Alexandre S. Mendes3, Pablo Moscato3, Klaas J. Veltink4
1Departamento de Engenharia de Sistemas, DENSIS Universidade Estadual de Campinas, UNICAMP C. P. 6101, 13081-970 Campinas, SP, Brazil
2Department of Accounting and Information Systems, College of Administrative Science, The University of Alabama in Huntsville, Huntsville, AL 35899, USA
3Department of Computer Science, School of Electrical Engineering and Computer Science, Faculty of Engineering and Built Environment, University of Newcastle Callaghan, 2308, NSW, Australia
4Department of Econometrics, University of Groningen Postbus 800, 9700 AV Groningen, The Netherlands

Tài liệu tham khảo

Allahverdi, 1999, A survey of scheduling research involving setup considerations, OMEGA, International Journal of Management Science, 27, 219 Aarts, 1994, A computational study of local search algorithms for job shop scheduling, ORSA Journal on Computing, 6, 118, 10.1287/ijoc.6.2.118 Cheng, 2000, A review of flowshop scheduling research with setup times, Production and Operations Management, 9, 283 Corne, 1999 Glass, 1996, A comparison of local search methods for flow shop scheduling, Annals of Operations Research, 63, 489, 10.1007/BF02156631 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). Gupta, 1986, The two-machine sequence dependent flowshop scheduling problem, European Journal of Operational Research, 24, 439, 10.1016/0377-2217(86)90037-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). Hitomi, 1977, An experimental investigation of group production scheduling, Proceedings of the fourth international conference on production research, Tokyo, 608 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. Moscato, P. (1989). On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms. Caltech Concurrent Computation Program, C3P Report 1989 826. Radcliffe, 1994, Formal memetic algorithms, 1 Schaller, 2000, Scheduling a flowline manufacturing cell with sequence dependent family setup times, European Journal of Operations Research, 125, 324, 10.1016/S0377-2217(99)00387-2