1[1]Graham R L, Lawler E L, Lenstra J K, Rinnooy Kan A H G. Optimization and approximation in deterministic sequencing and scheduling: a survery[J]. Annal of Discrete Mathimatics, 1979,(5):287-326.
2[2]Lawler E L,Lenstra J K,Rinnooy Kan A H G,Shmoys D B. Sequencing and Scheduling: Algorithms and Complexity[A]. Graves S C, Rinnooy Kan A H G, Zipkin P H. In Handbooks in Operations Research and Management Science, Vol 4, Logistic of Production and Inventory[C]. NorthHolland: Amsterdam, 1993.455-522.
3[3]Bellman R,Esogbue A O,Nabeshima I. Mathematical aspects of scheduling and applocations[M]. England: Pergamon, 1982.
4[4]Garey M R, Johnson D S, Sethi R. The Complexity of flowshop and jobshop scheduling[J]. Mathematics and Operations Research, 1976,1:117-129.
5[5]Lee C Y, Cheng T C E,Lin B M T. Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem[J]. Management Science, 1993,39:616-625.
