[1] 宣琦.基于复杂网络理论的复杂调度问题求解方法研究 [D].杭州: 浙江大学,2008. XUAN Qi. Research on complex scheduling problems based on complex network theory [D]. Hangzhou: Zhejiang University,2008. [2] 钱晓龙,唐立新,刘文新.动态调度的研究方法综述[J].控制与决策,2001,16 (2): 141-145. QIAN Xiaolong, TANG Lixin, LIU Wenxin. Dynamic scheduling: a survey of research methods [J]. Control and Decision, 2001, 16 (2): 141-145. [3] PANWALKAR S S, ISKANDER W. A survey of scheduling rules [J]. Operations Research, 1977, 25 (1): 45-61. [4] 李建详,唐立新,吴会江,等.基于规则的热轧钢管调度 [J].钢铁,2004,39 (9): 39-42. LI Jianxiang, TANG Lixin, WU Huijiang, et al. Scheduling the production of hot rolling steel tube: a rulebased heuristics [J]. Iron & Steel, 2004, 39 (9): 39-42. [5] 寿涌毅.并行工程项目调度的随机组合抽样算法[J].浙江大学学报:工学版,2006,40 (2): 344-347. SHOU Yongyi. Composite random sampling algorithm for scheduling concurrent projects [J]. Journal of Zhejiang University: Engineering Science, 2006, 40 (2): 344-347. [6] 宣琦,吴铁军.Open Shop复杂调度网络模型及特征分析[J].浙江大学学报: 工学版,2011,45(4): 589-595. XUAN Qi, WU Tiejun. Open shop complex scheduling network model and characteristic analysis [J]. Journal of Zhejiang University: Engineering Science, 2011, 45(4): 589-595 [7] ALBERT R, BARABSI A L. Statistical mechanics of complex networks [J]. Reviews of Modern Physics, 2002, 74(1):47-97. [8] BOCCALETTI S, LATORA V, MORENO Y, et al. Complex networks: structure and dynamics [J]. Physics Reports, 2006, 424 (45): 175-308. [9] PINEDO M. Scheduling: theory, algorithms, and systems [M]. 2nd ed. New Jersey: Prentice Hall, 2002: 18-19. [10] 王冰,席裕庚,谷寒雨.一类单机动态调度问题的改进滚动时域方法 [J].控制与决策, 2005, 20 (3): 257-265. WANG Bin, XI Yugeng, GU Hanyu. An improved rolling horizon procedure for singlemachine scheduling with release times [J]. Control and Decision, 2005, 20 (3): 257-265. [11] MANIMARAN G, MURTHY C S R. An efficient dynamic scheduling algorithm for multiprocessor realtime systems [J]. IEEE Transactions on Parallel and Distributed Systems, 1998, 9(3): 312-319. [12] SELLADURA V, ARAVINDAN P, PONNAMBALAM S G, et al. Dynamic simulation of job shop scheduling for optimal performance [J]. International Journal of Operations & Production Management, 1995, 15 (7): 106-120. [13] ABDULRAZAQ T S, POTTS C N. Dynamic programming statespace relaxation for singlemachine scheduling [J]. Journal of the Operational Research Society, 1988, 39(2): 141-152. [14] GOVIL M K, FU M C. Queueing theory in manufacturing: a survey [J]. Journal of Manufacturing Systems, 1999, 18 (3): 214-240. [15] NARAHARI Y, VISWANADHAM N. A petri net approach to the modeling and analysis of flexible manufacturing system [J]. Annals of Operations Research, 1985, 3(8): 449-472. [16] 罗小川,刘兴刚,李丹程,等.分布式测量系统服务窗口动态调度方法研究 [J].自动化学报,2008,34(6): 690-696. LUO Xiaochuan, LIU Xinggang, LI Dancheng, et al. Dynamic scheduling algorithm of service windows in a distributed measurement system [J]. Acta Automatica Sinica, 2008, 34(6): 690-696. [17] COSTA L DA F, RODRIGUES F A,.TRAVIESO G, et al. Characterization of complex networks: a survey of measurements [J]. Advances in Physics, 2007, 56 (1): 167-242. [18] TAILLARD E. Benchmarks for basic scheduling problems [J]. European Journal of Operational Research, 1993, 64(2): 278-285. [19] BOZOKI G, RICHARD J P. A branchandbound algorithm for the continuousprocess jobshop scheduling problem [J]. IIE Transactions, 1970, 2(3): 246-252. [20] DROZDOWSKI M. Scheduling multiprocessor tasksAn overview [J]. European Journal of Operational Research, 1996, 94(2): 215-230. [21] ADAMS J, BALAS E, ZAWACK D. The shifting bottleneck procedure for job shop scheduling [J]. Management Science, 1988, 34 (3): 391-401. [22] MOHANASUNDARAM K M, NATARAJAN K, VISWANATHKUMAR G, et al. Scheduling rules for dynamic shops that manufacture multilevel jobs [J]. Computers & Industr |