[1]Kirn K H, Park Y M, Ryll K R. Deriving decision rules to locate export containers in container yards [J]. European Journal of Operational Research, 2000, 124(1): 89101. [2]Zhang C R, Chen W W, Shi L Y, et al. A note on deriving decision rules to locate export containers in container yards [J]. European Journal of Operational Research, 2010, 205(4): 483485. [3]Lee Y S, Chao S L. A neighborhood search heuristic for premarshalling export containers [J]. European Journal of Operational Research, 2009, 196(2):468475. [4]江南,钱迈,渠洪涛,等. 集装箱堆场作业计划模型及算法[J].铁道学报, 2009,31(5):816. JIANG Nan, QIAN Mai, QU Hongtao, et al. Model and algorithm of container yard operation plans[J]. Journal of the China Railway Society,2009,31(5):816. [5]Shao X Y, Li X Y, Gao L, et al. Integration of process planning and schedulinga modified genetic algorithmbased approach[J]. Computers &Operations Research, 2009, 36(3): 20822096. [6]Qiao L H, Lv S P. An improved genetic algorithm for integrated process planning and scheduling[J]. Int J Adv Manuf Technol, 2012, 58(2): 727740. [7]沈斌,周莹君,王家海.基于自适应遗传算法的Job Shop调度问题研究[J]. 计算机应用, 2009,29(4):161167. SHEN Bin, ZHOU Yingjun, WANG Jiahai. Research of job shop scheduling problem based on selfadaptive genetic algorithm[J]. Journal of Computer Applications,2009,29(4):161167. [8]Chung C S, Flynn J, Kirca O. A branch and bound algorithm to minimize the total tardiness for mmachine permutation flow shop problems [J]. European Journal of Operational Research, 2006, 174(4): 110.
|