[1] POTTS C N.Analysis of a heuristic for one machine sequencing with release dates and delivery times[J].Operations Research,1980,28(6):1436-1441. [2] WOEGINGER G J.Heuristics for parallel machine scheduling with delivery times[J].ACTA Informatics,1994,31(6):503-512.
[3] WOEGINGER G J.A polynomial-time approximation scheme for single-machine sequencing with delivery times and sequence-independent batch set-up times[J].Journal of Scheduling,1998,1(1):79-87.
[4] HALL N G,LESAOANA M,POTTS C N.Scheduling with fixed delivery dates[J].Operations Research,2001,49(1):134-144.
[5] LI C L,VAIRAKTARAKIS G,LEE C Y.Machine scheduling with deliveries to multiple customer locations[J].European Journal of Operational Research,2005,164(1):39-51.
[6] CHEN Z L,VAIRAKTARAKIS G.Integrated scheduling of production and distribution operations[J].Management Science,2005,51(4):614-628.
[7] HALL N G,POTTS C N.Supply chain scheduling:batching and delivery[J].Operations Research,2003,51(4):566-584.
[8] KARP R M.Reducibility among combinatorial problems.complexity of computer computations[M].New York,NY,USA:Plenum Press,1972.
|