minimum markup_markup和margin_minimumversion(9)

[61] Liu M, Zheng FF, Chu CB,Xu YF; Single-machine scheng with past-sequence -dependent delivery times and release times. Inf. Process. Lett. 112(21): 835-838 (2012)

[60] Zhang WM,Xu YF, Zheng FF, Dong YC; Optimal algorithms for online time series search and one-way trading with interrelated prices. J. Comb. Optim. 23(2): 159-166 (2012)

[59] Liu M, Chu CB,Xu YF, Huo JZ; An optimal online algorithm for single machine scheng to minimize total general completion time. J. Comb. Optim. 23(2): 189-195 (2012)

[58] Liu M, Zheng FF, Chu CB,Xu YF; New results on single-machine scheng with past-sequence-dependent delivery times. Theor. Comput. Sci. 438: 55-61 (2012)

[57] Zheng FF,Xu YF, Poon CK, Zhang E, Wu XP; Online deadline scheng with preemption penalties. Computers & Industrial Engineering 60(4): 542-549 (2011)

[56] Zhang WM,Xu YF, Zheng FF, Liu M; Online algorithms for the general k-search problem. Inf. Process. Lett. 111(14): 678-682 (2011)

[55] Zhang GQ, Poon CK,Xu YF; The ski-rental problem with multiple discount options. Inf. Process. Lett. 111(18): 903-906 (2011)

[54] Liu M, Chu CB,Xu YF, Zheng FF; Semi-online scheng on 2 machines under a grade of service provision with bounded processing times. J. Comb. Optim. 21(1): 138-149 (2011)

[53]Xu YF, Zhang WM, Zheng FF; Optimal algorithms for the online time series search problem. Theor. Comput. Sci. 412(3): 192-197 (2011)

[52] Liu M, Zheng FF, Chu CB,Xu YF; Optimal algorithms for online scheng on parallel machines to minimize the makespan with a periodic availability constraint. Theor. Comput. Sci. 412(39): 5225-5231 (2011)

本文来自电脑杂谈，转载请注明本文网址：
http://www.pc-fly.com/a/tongxinshuyu/article-51865-9.html