Integrated Production and Outbound Distribution Scheduling: Review and Extensions

In many applications involving make-to-order or time-sensitive (e.g., perishable, seasonal) products, finished orders are often delivered to customers immediately or shortly after the production. Consequently, there is little or no finished product inventory in the supply chain such that production and outbound distribution are very intimately linked and must be scheduled jointly to achieve a desired on-time delivery performance at minimum total cost. Research on integrated scheduling models of production and outbound distribution is relatively recent but is growing very rapidly. In this paper, we provide a survey of such existing models. We present a unified model representation scheme, classify existing models into several different classes, and for each class of the models give an overview of the optimality properties, computational tractability, and solution algorithms for the various problems studied in the literature. We clarify the tractability of some open problems left in the literature and some new problems by providing intractability proofs or polynomial-time exact algorithms. We also identify several problem areas and issues for future research.

[1]  Zhi-Long Chen,et al.  Machine scheduling with transportation considerations , 2001 .

[2]  Asoo J. Vakharia,et al.  Integrated production/distribution planning in supply chains: An invited review , 1999, Eur. J. Oper. Res..

[3]  Marc Goetschalckx,et al.  Modeling and design of global logistics systems: A review of integrated strategic and tactical models and design algorithms , 2002, Eur. J. Oper. Res..

[4]  Guoqing Wang,et al.  Parallel machine scheduling with batch delivery costs , 2000 .

[5]  Sebastián Lozano,et al.  Production and delivery scheduling problem with time windows , 2005, Comput. Ind. Eng..

[6]  Jinjiang Yuan A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs , 1996 .

[7]  Chung-Lun Li,et al.  Coordinated scheduling of customer orders with decentralized machine locations , 2007 .

[8]  Lei Lei,et al.  A zero-inventory production and distribution problem with a fixed customer sequence , 2008, Ann. Oper. Res..

[9]  T. C. Edwin Cheng,et al.  Batch delivery scheduling with batch delivery cost on a single machine , 2007, Eur. J. Oper. Res..

[10]  David B. Shmoys,et al.  Approximation schemes for constrained scheduling problems , 1989, 30th Annual Symposium on Foundations of Computer Science.

[11]  T.C.E. Cheng,et al.  Survey of scheduling research involving due date determination decisions , 1989 .

[12]  Uttarayan Bagchi,et al.  Coordinated scheduling of customer orders for quick response , 2005 .

[13]  Chung Yee Lee,et al.  On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date , 1993 .

[14]  David B. Shmoys,et al.  Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better , 1992, Math. Oper. Res..

[15]  Guruprasad Pundoor,et al.  Integrated Order Scheduling and Packing , 2009 .

[16]  Chris N. Potts,et al.  The Coordination of Scheduling and Batch Deliveries , 2005, Ann. Oper. Res..

[17]  J. Gupta,et al.  A flow‐shop problem with sequence‐dependent additive setup times , 1987 .

[18]  Gerhard J. Woeginger,et al.  heuristics for parallel machine scheduling with delivery times , 1994, Acta Informatica.

[19]  Appa Iyer Sivakumar,et al.  Scheduling of single stage assembly with air transportation in a consumer electronic supply chain , 2006, Comput. Ind. Eng..

[20]  Chung-Lun Li,et al.  Machine scheduling with deliveries to multiple customer locations , 2005, Eur. J. Oper. Res..

[21]  Sebastián Lozano,et al.  A Comparison of GRASP and an Exact Method for Solving a Production and Delivery Scheduling Problem , 2001, HIS.

[22]  Chung Yee Lee,et al.  Production and transport logistics scheduling with two transport mode choices , 2005 .

[23]  Yong He,et al.  Improved algorithms for two single machine scheduling problems , 2006, Theor. Comput. Sci..

[24]  Chung-Yee Lee,et al.  Logistics scheduling with batching and transportation , 2008, Eur. J. Oper. Res..

[25]  H. Hoogeveen,et al.  Restarts Can Help in the On-Line Minimization of the Maximum Delivery Time on a Single Machine , 2000, ESA.

[26]  Igor Averbakh,et al.  On-line supply chain scheduling problems with preemption , 2007, Eur. J. Oper. Res..

[27]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[28]  Sebastián Lozano,et al.  Production and vehicle scheduling for ready-mix operations , 2004, Comput. Ind. Eng..

[29]  Han Hoogeveen,et al.  A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine , 2000, SIAM J. Discret. Math..

[30]  Chung Yee Lee,et al.  Two-machine shop scheduling with an uncapacitated interstage transporter , 2005 .

[31]  Stanisław Zdrzałka,et al.  Preemptive scheduling with release dates, delivery times and sequence independent setup times , 1994 .

[32]  Qian Wang,et al.  Sequencing the processing of incoming mail to match an outbound truck delivery schedule , 2005, Comput. Oper. Res..

[33]  Stanisłlaw Zdrzałka Approximation algorithms for single-machine sequencing with delivery times and unit batch set-up times , 1991 .

[34]  Chris N. Potts,et al.  Scheduling with Fixed Delivery Dates , 2001, Oper. Res..

[35]  T. C. Edwin Cheng,et al.  The Single Machine Batching Problem with Family Setup Times to Minimize Maximum Lateness is Strongly NP-Hard , 2003, J. Sched..

[36]  Steve Seiden Randomized Online Scheduling with Delivery Times , 1999, J. Comb. Optim..

[37]  Chris N. Potts,et al.  Supply chain scheduling: Batching and delivery , 2003, Oper. Res..

[38]  Philip Kaminsky,et al.  The effectiveness of the longest delivery time rule for the flow shop delivery time problem , 2003 .

[39]  Chung-Lun Li,et al.  On the Fixed Interval Due-date Scheduling Problem , 1996, Discret. Appl. Math..

[40]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

[41]  Zhi-Long Chen,et al.  Order Assignment and Scheduling in a Supply Chain , 2006, Oper. Res..

[42]  Stanisław Zdrzałka Analysis of approximation algorithms for single-machine scheduling with delivery times and sequence independent batch setup times , 1995 .

[43]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[44]  Chelliah Sriskandarajah,et al.  A review of TSP based approaches for flowshop scheduling , 2006, Eur. J. Oper. Res..

[45]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[46]  David L. Woodruff,et al.  Solving the medium newspaper production/distribution problem , 1999, Eur. J. Oper. Res..

[47]  Gerhard J. Woeginger,et al.  A polynomial‐time approximation scheme for single‐machine sequencing with delivery times and sequence‐independent batch set‐up times , 1998 .

[48]  Ameur Soukhal,et al.  Complexity of flow shop scheduling problems with transportation constraints , 2005, Eur. J. Oper. Res..

[49]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

[50]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[51]  S. Tayur,et al.  Due Date Management Policies , 2004 .

[52]  Rakesh Nagi,et al.  A review of integrated analysis of production-distribution systems , 1999 .

[53]  A. I. Sivakumar,et al.  Synchronized scheduling of assembly and multi-destination air-transportation in a consumer electronics supply chain , 2005 .

[54]  Chung-Lun Li,et al.  Machine scheduling with pickup and delivery , 2005 .

[55]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[56]  Chris N. Potts,et al.  Scheduling with batching: A review , 2000, Eur. J. Oper. Res..

[57]  Milind Dawande,et al.  Supply Chain Scheduling: Distribution Systems , 2006 .

[58]  Monaldo Mastrolilli,et al.  Efficient Approximation Schemes for Scheduling Problems with Release Dates and Delivery Times , 2003, J. Sched..

[59]  Ameur Soukhal,et al.  A note on the complexity of flow shop scheduling with transportation constraints , 2007, Eur. J. Oper. Res..

[60]  Chung-Yee Lee,et al.  Machine scheduling with job delivery coordination , 2004, Eur. J. Oper. Res..

[61]  Zhi-Long Chen,et al.  Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs , 1996 .

[62]  H. Neil Geismar,et al.  The Integrated Production and Transportation Scheduling Problem for a Product with a Short Lifespan , 2008, INFORMS J. Comput..

[63]  Mohamed Haouari,et al.  Minimizing makespan on parallel machines subject to release dates and delivery times , 2002 .

[64]  Gerard Sierksma,et al.  Small and large TSP: Two polynomially solvable cases of the traveling salesman problem , 1993 .

[65]  Xiuli Wang,et al.  Machine scheduling with an availability constraint and job delivery coordination , 2007 .

[66]  Leo Kroon,et al.  Exact and approximation algorithms for the operational fixed interval scheduling problem , 1995 .

[67]  Moshe Dror,et al.  Savings by Split Delivery Routing , 1989, Transp. Sci..

[68]  T. C. Edwin Cheng,et al.  Scheduling with job release dates, delivery times and preemption penalties , 2002, Inf. Process. Lett..

[69]  Sebastián Lozano,et al.  Coordinated scheduling of production and delivery from multiple plants , 2004 .

[70]  Bilge Bilgen,et al.  Strategic tactical and operational production-distribution models: a review , 2004, Int. J. Technol. Manag..

[71]  T. C. Edwin Cheng,et al.  Single machine scheduling with batch deliveries , 1996 .

[72]  Jaehwan Yang,et al.  The complexity of customer order scheduling problems on parallel machines , 2005, Comput. Oper. Res..

[73]  Zhiyi Tan,et al.  On the machine scheduling problem with job delivery coordination , 2007, Eur. J. Oper. Res..

[74]  George L. Vairaktarakis,et al.  Integrated Scheduling of Production and Distribution Operations , 2005, Manag. Sci..

[75]  Jan Karel Lenstra,et al.  PREEMPTIVE SCHEDULING IN A TWO-STAGE MULTIPROCESSOR FLOW SHOP IS NP-HARD , 1996 .

[76]  Sigrid Knust,et al.  Makespan minimization for flow-shop problems with transportation times and a single robot , 2001, Discret. Appl. Math..

[77]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[78]  C. N. Potts,et al.  Technical Note - Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times , 1980, Oper. Res..

[79]  Guruprasad Pundoor,et al.  Scheduling a production–distribution system to optimize the tradeoff between delivery tardiness and distribution cost , 2005 .

[80]  R. Gomory,et al.  Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem , 1964 .

[81]  Kathryn E. Stecke,et al.  Production and Transportation Integration for a Make-to-Order Manufacturing Company with a Commit-to-Delivery Business Mode , 2007, Manuf. Serv. Oper. Manag..

[82]  Chelliah Sriskandarajah,et al.  Some no-wait shops scheduling problems: Complexity aspect , 1986 .

[83]  Chung-Lun Li,et al.  Coordinating production and distribution of jobs with bundling operations , 2007 .