[1] MATI Y,REZG N,XIE X L.An integrated greedy heuristic for a flexible job shop scheduling problem[A].The Proceedings of IEEE International Conference on Systems,Man,and Cybernetics[C].Piscataway,NJ,USA:IEEE,2001.2534-2539. [2] BRUKER P,SCHLIE R.Job-shop scheduling with multi-purpose machines[J].Computing,1990,45(4):369-375.
[3] BRANDIMARTE P.Routing and scheduling in a flexible job shop by taboo search[J].Annals of Operations Research,1993,22(2):157-183.
[4] HAPKE M.Pareto simulated annealing for fuzzy multi-objective combinatorial optimization[J].Journal of Heuristics,2000,6(3):329-345.
[5] RIGAO C.Tardiness minimization in a flexible job shop: a tabu search approach[J].Journal of Intelligent Manufacturing,2004,15(1):103-115.
[6] DAUZèR-PéRèS S,PAULLI J.An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search[J].Annals of Operations Research,1997,70(3):281-306.
[7] MASTROLILLI M,GAMBARDELLA L M.Effective neighborhood functions for the flexible job shop problem[J].Journal of Scheduling,2002,3(1):3-20.
[8] KACEM I,HAMMADI S,BORNE P.Approach by localization and multi-objective evolutionary optimization for flexible job-shop scheduling problems[A].IEEE Transactions on Systems,Man and Cybernetics,Part C[C].Piscatway,NJ,USA:IEEE,2002,32(1):408-419.
[9] ZHOU Ming,SUN Shudong.Genetic algorithm theory and applications[D].Beijing:National Defense Industry Publisher,1999.133-134(in Chinese)[周 明,孙树栋.遗传算法原理及应用[M].北京:国防工业出版社,1999.133-134.]
[10] HYUN C J,KIM Y,KIM Y K.A genetic algorithm for multiple objective sequencing problems in mixed model assembly lines[J].Computers & Operations Research,1998,25(7/8): 675-690.
|