4S A Cook.The complexity of theorem proving proceduresProc of the rd Annual ACM Symp on Theory of Computing New,1997.
二级参考文献26
1LENSTRA J K, RINNOOY, KAN A H G, BRUCKER P. Complexity of machine scheduling problem[J]. Ann. Discr.Math. ,1997,(1):343-362.
2BLAZEWICZ J, DOMSCHKE W, PESCH E. The Job shop scheduling problem:conventional and new solution techniques [J]. European Journal of Research, 1996,93 ( 1 ): 1 - 33.
3JAIN A S,MEERAN S. Deterministic Job-shop scheduling: past,present and future[J]. European Journal of Research,1999,113(2) :390-434.
4LAARHOVEN Van P,AARTS E,LENSTRA J K. Job shop scheduling by simulated annealing[J]. Operations Research,1992,40(1) :113-125.
5NOWICKI E,SMUTNICKI C. A fast taboo search algorithm for the Job shop problem[J]. Management Science, 1996, 42(6):797-813.
6CARLIER J,PINSON F. An algorithm for solving the Jobshop problem[J]. Management Science, 1989,35 (2): 164 -176.
7RODAMMER F A,WHITE K P. A recent survey of production scheduling[J]. IEEE Trans. SMC, 1988,18 (6): 841 -851.
8MITSOU G, YASUHIRO T, ERIKA K. Solving Job- shop scheduling problems by genetic algorithm[A]. Proceedings of the 1995 IEEE International Conference on Systems, Man,and Cybernetics[C]. Vancouver:Institute of Electrical and Electronics Engineers, 1995. 1577- 1582.
9GUOYONG S, HITOSHI ⅡMA,NOBUO S. A new encoding scheme for Job Shop problems by Genetic Algorithm[A].Proceedings of the 35th Conference on Decision and Control[C]. Kobe,Japan, 1996.4395-4400.
10CHEN Xiong, KONG Qingsheng,WU Qidi. Hybird algorithm for Job-shop scheduling problem[A]. Proceeding of the 4th Congress on Intelligent Control and Automation[C]. Shanghai: East China Univ. of S&T Press, 2002. 1739-1743.
