[1] GAREY M R, JOHNSON D S, SETHI R. The complexity of flowshop and jobshop scheduling[J]. Mathematics of Operations Research, 1976, 1(2):117-129. [2] BALAS E. Machine sequencing via disjunctive graphs:an implicit enumeration algorithm[J]. Operations Research, 1968, 17(6):941-957. [3] VAN HULLE M M. A goal programming network for mixed integer linear programming:a case study for the job-shop scheduling problem[J]. International Journal of Neural Systems, 1991, 2(3):201-209. [4] LUH P B, HOITOMT D J. Scheduling of manufacturing systems using the Lagrangian relaxation technique[J]. IEEE Transactions on Automatic Control, 1993, 38(7):1066-1079. [5] GIFFLER B, THOMPSON G L. Algorithms for solving production scheduling problems[J]. Operations Research, 1960, 8(4):487-503. [6] ADAMS J, BALAS E, ZAWACK D. The shifting bottleneck procedure for job shop scheduling[J]. Management Science, 1988, 34(3):391-401. [7] SIMON F Y-P, TAKEFUJI Y. Stochastic neural networks for solving job-shop scheduling. Ⅰ. problem representation[C]//Proceedings of the 1988 IEEE International Conference on Neural Networks. Piscataway, NJ:IEEE, 1988:275-282. [8] SIMON F Y-P, TAKEFUJI Y. Stochastic neural networks for solving job-shop scheduling. Ⅱ. architecture and simulations[C]//Proceedings of the 1988 IEEE International Conference on Neural Networks. Piscataway, NJ:IEEE, 1988:283-290. [9] SIMON F Y-P, TAKEFUJI Y. Integer linear programming neural networks for job-shop scheduling[C]//Proceedings of the 1988 IEEE International Conference on Neural Networks. Piscataway, NJ:IEEE, 1988:341-348. [10] REMUS W. Neural network models of managerial judgment[C]//Proceedings of the 23rd Annual Hawaii International Conference on System Sciences. Piscataway, NJ:IEEE, 1990:340-344. [11] GLOVER F. New approaches for heuristic search:a bilateral linkage with artificial intelligence[J]. European Journal of Operational Research, 1989, 39(2):119-130. [12] ATASHPAZ-GARGARI E, LUCAS C. Imperialist competitive algorithm:an algorithm for optimization inspired by imperialistic competition[C]//CEC 2007:Proceedings of the 2007 IEEE Congress on Evolutionary Computation. Piscataway, NJ:IEEE, 2007:4661-4667. [13] GLOVER F. Future paths for integer programming and links to artificial intelligence[J]. Computers & Operations Research, 1986, 13(5):533-549. [14] ZHANG R, SONG S, WU C. A hybrid artificial bee colony algorithm for the job shop scheduling problem[J]. International Journal of Production Economics, 2013, 141(1):167-178. [15] GAO L, ZHANG G, ZHANG L, et al. An efficient memetic algorithm for solving the job shop scheduling problem[J]. Computers & Industrial Engineering, 2011, 60(4):699-705. [16] ZUO X, WANG C, TAN W. Two heads are better than one:an AIS-and TS-based hybrid strategy for job shop scheduling problems[J]. International Journal of Advanced Manufacturing Technology, 2012, 63(1):155-168. [17] REN Q-D-E-J, WANG Y. A new hybrid genetic algorithm for job shop scheduling problem[J]. Computers & Operations Research, 2012, 39(10):2291-2299. [18] 赵诗奎,方水良,顾新建.作业车间调度的空闲时间邻域搜索遗传算法[J].计算机集成制造系统,2014,20(8):1930-1940.(ZHAO S K, FANG S L, GU X J. Idle time neighborhood search genetic algorithm for job shop scheduling[J]. Computer Integrated Manufacturing Systems, 2014, 20(8):1930-1940.). [19] ZHANG C, RAO Y, LI P. An effective hybrid genetic algorithm for the job shop scheduling problem[J]. International Journal of Advanced Manufacturing Technology, 2008, 39(9):965-974. [20] DELL'AMICO M, TRUBIAN M. Applying tabu-search to the job shop scheduling problem[J]. Annals of Operations Research, 1993, 41(3):231-252. [21] NOWICKI E, SMUTNICKI C. A fast taboo search algorithm for the job shop problem[J]. Management Science, 1996, 42(6):797-813. [22] BALAS E, VAZACOPOULOS A. Guided local search with shifting bottleneck for job shop scheduling[J]. Management Science, 1998, 44(2):262-275. |