Integrated Scheduling of Production and Distribution Operations

References

• Bramel J., Simchi-Levi D.Logic of Logistics: Theory, Algorithms, and Applications for Logistics Management (1997) (Springer-Verlag, New York) Crossref, Google Scholar
• Chandra P., Fisher M. L. Coordination of production and distribution planning. Eur. J. Oper. Res. (1994) 72:503–517Crossref, Google Scholar
• Chen Z.-L. Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs. Eur. J. Oper. Res. (1996) 93:49–60Crossref, Google Scholar
• Chen Z.-L., Simchi-Levi D., Wu D., Shen Z.-J. Integrated production and distribution operations: Taxonomy, models, and review. Handbook of Quantitative Supply Chain Analysis: Modeling in the E-Business Era (2004) (Kluwer Academic Publishers, Boston, MA) Crossref, Google Scholar
• Cheng T. C. E., Gordon V. S., Kovalyov M. Y. Single machine scheduling with batch deliveries. Eur. J. Oper. Res. (1996) 94:277–283Crossref, Google Scholar
• Cohen M. A., Lee H. L. Strategic analysis of integrated production-distribution systems: Models and methods. Oper. Res. (1988) 36:212–228Link, Google Scholar
• Conway R. W., Maxwell W. L., Miller L. W.Theory of Scheduling (1967) (Addison-Wesley, Reading, MA) Google Scholar
• Feld W. M.Lean Manufacturing: Tools, Techniques and How to Use Them (2000) (CRC Press, Boca Raton, FL) Crossref, Google Scholar
• Fumero F., Vercellis C. Synchronized development of production, inventory, and distribution schedules. Transportation Sci. (1999) 33:330–340Link, Google Scholar
• Garey M. R., Johnson D. S.Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (W. H. Freeman, San Francisco, CA) Google Scholar
• Geismar H. N., Lei L., Sriskandarajah C. The integrated production and transportation scheduling problem for a product with a short life span and non-instantaneous transportation time. (2003) . Working paper, University of Texas at Dallas, Dallas, TXGoogle Scholar
• Hahm J., Yano C. A. Economic lot and delivery scheduling problem: Powers of two policies. Transportation Sci. (1995) 29:222–241Link, Google Scholar
• Hall N. G., Potts C. N. Supply chain scheduling: Batching and delivery. Oper. Res. (2003) 51:566–584Link, Google Scholar
• Hall L. A., Shmoys D. B. Jackson’s rule for single-machine scheduling: Making a good heuristic better. Math. Oper. Res. (1992) 17:22–35Link, Google Scholar
• Hall N. G., Lesaoana M., Potts C. N. Scheduling with fixed delivery dates. Oper. Res. (2001) 49:134–144Link, Google Scholar
• Herrmann J., Lee C.-Y. On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date. Eur. J. Oper. Res. (1993) 70:272–288Crossref, Google Scholar
• Karp R. M., Miller R. E., Thatcher J. W. Reducibility among combinatorial problems. Complexity of Computer Computations (1972) (Plenum Press, New York) 85–103Crossref, Google Scholar
• Lee C.-Y., Chen Z.-L. Machine scheduling with transportation considerations. J. Scheduling (2001) 4:3–24Crossref, Google Scholar
• Li C.-L., Vairaktarakis G., Lee C.-Y. Machine scheduling with deliveries to multiple customer locations. Eur. J. Oper. Res. (2005) 164:39–51Crossref, Google Scholar
• Pinedo M.Scheduling: Theory, Algorithms, and Systems (2002) 2nd ed.(Prentice Hall, Upper Saddle River, NJ) Google Scholar
• Potts C. N. Analysis of a heuristic for one machine sequencing with release dates and delivery times. Oper. Res. (1980) 28:1436–1441Link, Google Scholar
• Rajagopalan S., Malhotra A. Have U.S. manufacturing inventories really decreased? An empirical study. Manufacturing Service Oper. Management (2001) 3:14–24Link, Google Scholar
• Sarmiento A. M., Nagi R. A review of integrated analysis of production-distribution systems. IIE Trans. (1999) 31:1061–1074Crossref, Google Scholar
• Woeginger G. J. Heuristics for parallel machine scheduling with delivery times. Acta Inform. (1994) 31:503–512Crossref, Google Scholar
• Woeginger G. J. A polynomial-time approximation scheme for single-machine sequencing with delivery times and sequence-independent batch set-up times. J. Scheduling (1998) 1:79–87Crossref, Google Scholar