参考文献

[1]KOULAMAS C.Inverse scheduling with controllable job parameters[J].International Journal of Services and Operations Management,2005,1(1):35-43.

[2]BRUCKER P,SHAKHLEVICH N V.Inverse scheduling with maximum lateness objective[J].Journal of Scheduling,2009,12(5):475-488.

[3]陈荣军，唐国春.单机供应链排序及流水作业的反问题模型[J].运筹与管理，2009，18（2）：80-84.

[4]陈荣军，陈峰，唐国春.单台机器总完工时间排序问题的反问题[J].上海第二工业大学学报，2005，22（2）：7.

[5]BRUCKER P,SHAKHLEVICH N V.Inverse scheduling:two-machine flow-shop problem[J].Journal of Scheduling,2011,14(3):239-256.

[6]VICKSON R.Choosing the job sequence and processing times to minimize total processing plus flow cost on a single machine[J].Operations Research,1980,28(5):1155-1167.

[7]NOWICKI E,ZDRZAŁKA S.A survey of results for sequencing problems with controllable processing times[J].Discrete Applied Mathematics,1990,26(2-3):271-287.

[8]CHAND S,CHHAJED D.A single machine model for determination of optimal due dates and sequence[J].Operations Research,1992,40(3):596-602.

[9]TRICK M A.Scheduling multiple variable-speed machines[J].Operations research,1994,42(2):234-248.

[10]陈荣军.单台机器总完工时间随机排序问题的反问题[J].常州工学院学报，2006，19（6）：1-5.

[11]LENSTRA J K,KAN A R.Computational complexity of discrete optimization problems [M].Annals of Discrete Mathematics.Elsevier,1979:121-140.

[12]HONGTRUONG P，鲁习文.平行机上单位加工时间加权总完工时间排序问题的反问题[J].华东理工大学学报（自然科学版），2012，38（6）：5.

[13]ZHANG F,NG C T,TANG G,et al.Inverse scheduling:applications in shipping[J].Nternational Journal of Shipping and Transport Logistics,2011,3(3):312-322.

[14]BRUCKER P,SHAKHLEVICH N V.Inverse scheduling with maximum lateness objective[J].Journal of Scheduling,2009,12(5):475-488.

[15]BRUCKER P,SHAKHLEVICH N V.Inverse scheduling:two-machine flow-shop problem[J].Journal of Scheduling,2011,14(3):239-256. DueSk7/3YOip2xbcd/lj+BPJVH5P6XB0FCC69+MUeMtb3yKC2axVEz9MV3tSz1ya