下载掌阅APP，畅读海量书库
立即打开
[1]HEUBERGER C.Inverse Combinatorial Optimization:A survey on problems,methods,and results[J].Journal of Combinatorial Optimization,2004,8(3):329-361.
[2]LIU L,WANG Q.Constrained inverse min-max spanning tree problems under the weighted hamming distance[J].Journal of Global Optimization,2009,43(1):83-95.
[3]ZHANG J,MA Z,YANG C.A column generation method for inverse shortest path problems[J].Zeitschrift für Operations Research,1995,41(3):347-358.
[4]ZHANG J,LIU Z.A general model of some inverse combinatorial optimization problems and its solution method under l ∞ norm[J].Journal of Combinatorial Optimization,2002,6(2):207-227.
[5]DIAL R B.Minimal-revenue congestion pricing partⅠ:a fast algorithm for the single-origin case[J].Transportation Research Part B:Methodological,1999,33(3):189-202.
[6]JIANG Y,LIU L,WU B,et al.Inverse minimum cost flow problems under the weighted hamming distance[J].European Journal of Operational Research,2010,207(1):50-54.
[7]BALAS,E.Machine Sequencing Via Disjunctive Graphs:An implicit enumeration algorithm[J].Operations Research,1969,17(6):941-957.
[8]ADAMS J,ZAWACK B D.The shifting bottleneck procedure for job shop scheduling[J].Management Science,1988,34(3):391-401.
[9]SMITH S F.Constructing and Maintaining Detailed Production Plans Investigations into the development of knowledge-based factory scheduling systems[J].AI magazine,1986,7(4):45-61.
[10]DORIGO M,GAMBARDELLA L M.Ant colony system:a cooperative learning approach to the traveling salesman problem[J].IEEE Transactions on Evolutionary Computation,1997,1(1):53-66.
[11]高亮，高海兵，周驰.基于粒子群优化的开放式车间调度[J].机械工程学报，2006，42（2）：6.
[12]GLOVER F.Future paths for integer programming and links to artificial intelligence[J].Computers&Operations Research,1986,13(5):533-549.
[13]YELLIG E J,MACKULAK G T.Robust deterministic scheduling in stochastic environments:The method of capacity hedge points[J].International Journal of Production Research,1997,35(2):369-379.
[14]SHNITS B,RUBINOVITZ J,SINREICH D.Multicriteria dynamic scheduling methodology for controlling a flexible manufacturing system[J].International Journal of Production Research,2004,42(17):3457-3472.
[15]SABUNCUOGLU I,BAYIZ M.Analysis of reactive scheduling problems in a job shop environment[J].European Journal of Operational Research,2000,126(3):567-586.
[16]SINGER M.Decomposition methods for large job shops[J].Computers&Operations Research,2001,28(3):193-207.
[17]SHAFAEI R,BRUNN P.Workshop scheduling using practical (inaccurate) data Part Ⅰ:the performance of heuristic scheduling rules in a dynamic job shop environment using a rolling time horizon approach[J].International Journal of Production Research,1999,37(17):3913-3925.
[18]潘全科，朱剑英.作业车间动态调度研究[J].南京航空航天大学学报，2005，37（2）：262-268.
[19]AYTUG H,LAWLEY M A,MCKAY K,et al.Executing production schedules in the face of uncertainties:A review and some future directions[J].European Journal of Operational Research,2005,161(1):86-110.
[20]MATSUURA H,TSUBONE H,KANEZASHI M.Sequencing,dispatching and switching in a dynamic manufacturing environment[J].The International Journal of Production Research,1993,31(7):1671-1688.