Integrated production and outbound distribution scheduling: Review and extensions

Operations Research

Volumn 58, Issue 1, 2010, Pages 130-148

  Chen, Zhi Long ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

Optimality properties; Outbound distribution; Production scheduling; Representation scheme; Solution algorithms; Survey

Indexed keywords

OPTIMALITY; PRODUCTION SCHEDULING; REPRESENTATION SCHEME; REPRESENTATION SCHEMES; SOLUTION ALGORITHMS;

PRODUCTION ENGINEERING; SUPPLY CHAINS; SURVEYS;

ALGORITHMS;

EID: 77249147436     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1080.0688     Document Type: Review

References (81)

1. Amstrong, R., S. Gao, L. Lei. 2008. A zero-inventory production and distribution problem with a fixed customer sequence. Ann. Oper. Res. 159 395-414.
2. Averbakh, I., Z. Xue. 2007. On-line supply chain scheduling problems with preemption. Eur. J. Oper. Res. 181 500-504.
3. Bagchi, T. P., J. N. D. Gupta, C. Sriskandarajah. 2006. A review of TSP based approaches for flowshop scheduling. Eur. J. Oper. Res. 169 816-854.
4. Ball, M. O., T. L. Magnanti, C. L. Monma, G. L. Nemhauser. 1995. Network Routing. Handbooks in Operations Research and Management Science, Vol.8. North-Holland, Amsterdam.
5. Bilgen, B., I. Ozkarahan. 2004. Strategic tactical and operational production-distribution models: A review. Internat. J. Tech. Management 28 151-171.
6. Chang, Y.-C., C.-Y. Lee. 2004. Machine scheduling with job delivery coordination. Eur. J. Oper. Res. 158 470-487.
7. Chen, B., C.-Y. Lee. 2008. Logistics scheduling with batching and transportation. Eur. J. Oper. Res. 189 871-876.
8. Chen, Z.-L. 1996. Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs. Eur. J. Oper. Res. 93 49-60.
9. Chen, Z.-L. 2004. Integrated production and distribution operations: Taxonomy, models, and review. D. Simchi-Levi, S. D. Wu, Z.-J. Shen, eds. Handbook of Quantitative Supply Chain Analysis: Modeling in the E-Business Era. Kluwer Academic Publishers, Norwell, MA.
10. Chen, Z.-L., G. Pundoor. 2006. Order assignment and scheduling in a supply chain. Oper. Res. 54 555-572.
11. Chen, Z.-L., G. Pundoor. 2009. Integrated order scheduling and packing. Production Oper. Management, ePub ahead of print March 9.
12. Chen, Z.-L., G. L. Vairaktarakis. 2005. Integrated scheduling of production and distribution operations. Management Sci. 51 614-628.
13. Cheng, T. C. E., M. C. Gupta. 1989. Survey of scheduling research involving due date determination decision. Eur. J. Oper. Res. 38 156-166.
14. Cheng, T. C. E., H. G. Kahlbacher. 1993. Scheduling with delivery and earliness penalties. Asia-Pacific J. Oper. Res. 10 145-152.
15. Cheng, T. C. E., V. S. Gordon, M. Y. Kovalyov. 1996. Single machine scheduling with batch deliveries. Eur. J. Oper. Res. 94 277-283.
16. Cheng, T. C. E., C. T. Ng, J. J. Yuan. 2003. The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard. J. Scheduling 6 483-490.
17. Dawande, M., H. N. Geismar, N. G. Hall, C. Sriskandarajah. 2006. Supply chain scheduling: Distribution systems. Production Oper. Management 15 243-261.
18. Devapriya, P., W. Ferrell, N. Geismar. 2006. Optimal fleet size of an integrated production and distribution scheduling problem for a perishable product. Working paper, Clemson University, Clemson, SC.
19. Dror, M., P. Trudeau. 1989. Savings by split delivery routing. Transportation Sci. 23 23-37.
20. Erenguc, S. S., N. C. Simpson, A. J. Vakharia. 1999. Integrated production/distribution planning in supply chains: An invited review. Eur. J. Oper. Res. 115 219-236.
21. Garcia, J. M., S. Lozano. 2004. Production and delivery scheduling problem with time windows. Comput. Indust. Engrg. 48 733-742.
22. Garcia, J. M., S. Lozano. 2005. Production and vehicle scheduling for ready-mix operations. Comput. Indust. Engrg. 46 803-816.
23. Garcia, J. M., S. Lozano, D. Canca. 2004. Coordinated scheduling of production and delivery from multiple plants. Robotics and Comput.-Integrated Manufacturing 20 191-198.
24. Garcia, J. M., K. Smith, S. Lozano, F. Guerrero. 2002. A comparison of GRASP and an exact method for solving a production and delivery scheduling problem. Proc. Hybrid Inform. Systems: Adv. Soft Comput. Heidelberg, Physica-Verlag, 431-447.
25. Garey, M. R., D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York.
26. Geismar, H. N., G. Laporte, L. Lei, C. Sriskandarajah. 2008. The integrated production and transportation scheduling problem for a product with a short life span and non-instantaneous transportation time. INFORMS J. Comput. 20 21-33.
27. Gharbi, A., M. Haouari. 2002. Minimizing makespan on parallel machines subject to release dates and delivery times. J. Scheduling 5 329-355.
28. Gilmore, P. C., R. E. Gomory. 1964. Sequencing a one state-variable machine: A solvable case of the traveling salesman problem. Oper. Res. 12 655-679.
29. Goetschalckx, M., C. J. Vidal, K. Dogan. 2002. Modeling and design of global logistics systems: A review of integrated strategic and tactical models and design algorithms. Eur. J. Oper. Res. 143 1-18.
30. Hall, L. A., D. B. Shmoys. 1989. Approximation algorithms for constrained scheduling problems. Proc. 30th Annual Sympos. Foundations Comput. Sci. 134-140.
31. Hall, L. A., D. B. Shmoys. 1992. Jackson's rule for single-machine scheduling: Making a good heuristic better. Math. Oper. Res. 17 22-35.
32. Hall, N. G., C. N. Potts. 2003. Supply chain scheduling: Batching and delivery. Oper. Res. 51 566-584.
33. Hall, N. G., C. N. Potts. 2005. The coordination of scheduling and batch deliveries. Ann. Oper. Res. 135 41-64.
34. Hall, N. G., C. Sriskandarajah. 1996. A survey of machine scheduling problems with blocking and no-wait in process. Oper. Res. 44 510-525.
35. Hall, N. G., M. Lesaoana, C. N. Potts. 2001. Scheduling with fixed delivery dates. Oper. Res. 49 134-144.
36. He, Y., W. Zhong, H. Gu. 2006. Improved algorithms for two single machine scheduling problems. Theoret. Comput. Sci. 363 257-265.
37. Herrmann, J. W., C.-Y. Lee. 1993. On scheduling to minimize earlinesstardiness and batch delivery costs with a common due date. Eur. J. Oper. Res. 70 272-288.
38. Hoogeveen, J. A., A. P. A. Vestjens. 2000. A best possible deterministic on-line algorithm for minimizing maximum delivery time on a single machine. SIAM J. Discrete Math. 13 56-63.
39. Hurink, J., S. Knust. 2001. Makespan minimization for flow-shop problems with transportation times and a single robot. Discrete Appl. Math. 112 199-216.
40. Ji, M., Y. He, T. C. E. Cheng. 2007. Batch delivery scheduling with batch delivery cost on a single machine. Eur. J. Oper. Res. 176 745-755. (Pubitemid 44537608)
41. Kaminsky, P. 2003. The effectiveness of the longest delivery time rule for the flow shop delivery time problem. Naval Res. Logist. 50 257-272.
42. Karp, R. M. 1972. Reducibility among combinatorial problems. R. E. Miller, J. W. Thatcher, eds. Complexity of Computer Computations. Plenum Press, New York, 85-103.
43. Keskinocak, P., S. Tayur. 2004. Due date management policies. D. Simchi- Levi, S. D. Wu, Z.-J. Shen, eds. Handbook of Quantitative Supply Chain Analysis: Modeling in the E-Business Era. Kluwer Academic Publishers, Norwell, MA, 485-553.
44. Kroon, L. G., M. Salomon, L. N. Van Wassenhove. 1995. Exact and approximation algorithms for the operational fixed interval scheduling problem. Eur. J. Oper. Res. 82 190-205.
45. Langley, C. J., E. van Dort, S. R. Sykes. 2006. 2005 Third-Party Logistics: Results and Findings of the 10th Annual Study.
46. Lawler, E. L., J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys. 1993. Sequencing and scheduling: Algorithms and complexity. Handbooks in Operations Research and Management Science, Vol.4. North-Holland, Amsterdam, 445-552.
47. Lee, C.-Y., Z.-L. Chen. 2001. Machine scheduling with transportation considerations. J. Scheduling 4 3-24.
48. Lee, C.-Y., C.-L. Li. 1996. On the fixed interval due-date scheduling problem. Discrete Appl. Math. 68 101-117.
49. Lee, C.-Y., V. A. Strusevich. 2005. Two-machine shop scheduling with an uncapacitated interstage transporter. IIE Trans. 37 725-736.
50. Lenstra, J. K., A. H. G. Rinnooy Kan, P. Brucker. 1977. Complexity of machine scheduling problems. Ann. Discrete Math. 1 343-362.
51. Li, C.-L., J. Ou. 2005. Machine scheduling with pickup and delivery. Naval Res. Logist. 52 617-630.
52. Li, C.-L., J. Ou. 2007. Coordinated scheduling of customer orders with decentralized machine locations. IIE Trans. 39 899-909.
53. Li, C.-L., G. Vairaktarakis. 2007. Coordinating production and distribution of jobs with bundling operations. IIE Trans. 39 203-215.
54. Li, C.-L., G. Vairaktarakis, C.-Y. Lee. 2005a. Machine scheduling with deliveries to multiple customer locations. Eur. J. Oper. Res. 164 39-51.
55. Li, K. P., V. K. Ganesan, A. I. Sivakumar. 2005b. Synchronized scheduling of assembly and multi-destination air-transportation in a consumer electronics supply chain. Internat. J. Production Res. 43 2671-2685.
56. Li, K. P., V. K. Ganesan, A. I. Sivakumar. 2006. Scheduling of single stage assembly with air transportation in a consumer electronic supply chain. Comput. Indust. Engrg. 51 264-278.
57. Liu, Z., T. C. E. Cheng. 2002. Scheduling with job release dates, delivery times and preemption penalties. Inform. Processing Lett. 82 107-111.
58. Mastrolilli, M. 2003. Efficient approximation schemes for scheduling problems with release dates and delivery times. J. Scheduling 6 521-531.
59. Pinedo, M. 2002. Scheduling Theory, Algorithms, and Systems, 2nd ed. Prentice Hall, Upper Saddle River, NJ.
60. Potts, C. N. 1980. Analysis of a heuristic for one machine sequencing with release dates and delivery times. Oper. Res. 28 1436-1441.
61. Potts, C. N., M. Y. Kovalyov. 2000. Scheduling with batching: A review. Eur. J. Oper. Res. 120 228-249.
62. Pundoor, G., Z.-L. Chen. 2005. Scheduling a production-distribution system to optimize the tradeoff between delivery tardiness and total distribution cost. Naval Res. Logist. 52 571-589.
63. Sarmiento, A. M., R. Nagi. 1999. A review of integrated analysis of production-distribution systems. IIE Trans. 31 1061-1074.
64. Seiden, S. 1999. Randomized online scheduling with delivery times, J. Combin. Optim. 3 399-416.
65. Soukhal, A., A. Oulamara, P. Martineau. 2005. Complexity of flow shop scheduling problems with transportation constraints. Eur. J. Oper. Res. 161 32-41.
66. Sriskandarajah, C., P. Ladet. 1986. Some no-wait shops scheduling problems: Complexity aspects. Eur. J. Oper. Res. 24 424-438.
67. Stecke, K. E., X. Zhao. 2007. Production and transportation integration for a make-to-order manufacturing company with a commit-todelivery business mode. Manufacturing Service Oper. Management 9 206-224.
68. Van Buer, M. G., D. L. Woodruff, R. T. Olson. 1999. Solving the medium newspaper production/distribution problem. Eur. J. Oper. Res. 115 237-253.
69. van den Akker, M., H. Hoogeveen, N. Vakhania. 2000. Restarts can help in the on-line minimization of the maximum delivery time on a single machine. J. Scheduling 3 333-341.
70. Wang, G., T. C. E. Cheng. 2000. Parallel machine scheduling with batch delivery costs. Internat. J. Production Econom. 68 177-183.
71. Wang, H., C.-Y. Lee. 2005. Production and transport logistics scheduling with two transport mode choices. Naval Res. Logist. 52 796-809.
72. Wang, Q., R. Batta, R. J. Szczerba. 2005. Sequencing the processing of incoming mail to match an outbound truck delivery schedule. Comput. Oper. Res. 32 1777-1791.
73. Wang, X., T. C. E. Cheng. 2007. Machine scheduling with an availability constraint and job delivery coordination. Naval Res. Logist. 54 11-20.
74. Woeginger, G. J. 1994. Heuristics for parallel machine scheduling with delivery times. Acta Informatica 31 503-512.
75. Woeginger, G. J. 1998. A polynomial-time approximation scheme for single-machine sequencing with delivery times and sequenceindependent batch set-up times. J. Scheduling 1 79-87.
76. Yuan, J. 1996. A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs. Eur. J. Oper. Res. 94 203-205.
77. Yuan, J., A. Soukhal, Y. Chen, L. Lu. 2007. A note on the complexity of flow shop scheduling with transportation constraints. Eur. J. Oper. Res. 178 918-925.
78. Zdrzalka, S. 1991. Approximation algorithms for single-machine sequencing with delivery times and unit batch set-up times. Eur. J. Oper. Res. 51 199-209.
79. Zdrzalka, S. 1994. Preemptive scheduling with release dates, delivery times and sequence independent setup times. Eur. J. Oper. Res. 76 60-71.
80. Zdrzalka, S. 1995. Analysis of approximation algorithms for singlemachine scheduling with delivery times and sequence independent batch setup times. Eur. J. Oper. Res. 80 371-380.
81. Zhong, W., G. Dosa, Z. Tan. 2007. On the machine scheduling problem with job delivery coordination. Eur. J. Oper. Res. 182 1057-1072.