1[1]KENNETH R B.Sequencing with earliness and tardiness penalties:A review[J] .Operations Research, 1990,38 (1) :22-36.
2[2]CHEN Zhi-Long.Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs[J].European Journal of Operational Research, 1996,93(1 ): 49-60.
3[3]BERTRAND W T.Lin batch scheduling in the no-wait two-machine flowshop to minimize the Makespan[J].Computers & Operations Research, 2001,28(7): 613-624.
4[4]Stanislaw zdrzalka analysis of approximation algorithms for single Machine scheduling with delivery times and sequencet independen Bat setup times[J].European Journal of Operational Research, 1995,80(2): 371-380.
5[5]CHEN Zhi-Long.Scheduling with batch setup time and earliness tardiness penalties[J].European Journal of Operational Research,1997,96(3):518-537.
5Lee D Y, Dicesare F. Scheduling flexible manufacturing systems using Petri nets and heuristic search[J]. IEEE Trans on Rohoties and Automation, 1994,10(2) : 127- 132.
6GORDON V, PROTH J M, CHU C. A survey of the state-of-the-art of common due date assignment and scheduling research[J]. European Journal of Operational Research, 2002, 139(1): 1 - 25.
7KRAMER F J, LEE C Y. Common due window scheduling[J]. Pro- duction and Operations Management, 1993, 2(2): 262 - 275.
8LIMAN S D, PANWALKAR S S, THONG S. Determination of com- mon due window location in a single machine scheduling problem[J]. European Journal of Operational Research, 1996, 93(1): 68 - 74.
9LIMAN S D, PANWALKAR S S, THONG S. Common due window size and location determination in a single machine scheduling[J]. Journal of the Operational Research Society, 1998, 49(9): 1007 - 1010.
10LIMAN S D, RAMSWAMY S. Earliness-tardiness scheduling prob- lems with a common delivery window[J]. Operations Research Let- ters, 1994, 15(4): 195- 203.
