Approximation Algorithms for the Supplier's Supply Chain Scheduling Problem to Minimize Delivery and Inventory Holding Costs

Published Online:https://doi.org/10.1287/opre.1080.0622

References

  • Agnetis A., Hall N. G., Pacciarelli D. Supply chain scheduling: Sequence coordination. Discrete Appl. Math. (2006) 154:2044–2063CrossrefGoogle Scholar
  • Albers S., Brucker P. The complexity of one-machine batching problems. Discrete Appl. Math. (1993) 47:87–107CrossrefGoogle 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–60CrossrefGoogle Scholar
  • Chen Z. L. Scheduling with batch setup times and earliness-tardiness penalties. Eur. J. Oper. Res. (1997) 96:518–537CrossrefGoogle Scholar
  • Chen Z. L., Hall N. G. Supply chain scheduling: Conflict and cooperation in assembly systems. Oper. Res. (2007) 55:1072–1089LinkGoogle Scholar
  • Chen Z. L., Vairaktarakis G. L. Integrated scheduling of production and distribution operations. Management Sci. (2005) 51:614–628LinkGoogle Scholar
  • Cheng T. C. E., Gordon V. S., Kovalyov M. Y. Single machine scheduling with batch deliveries. Eur. J. Oper. Res. (1996) 94:277–283CrossrefGoogle Scholar
  • Coffman E. G., Yannakakis M., Magazine M. J., Santos C. Batch sizing and job sequencing on a single machine. Ann. Oper. Res. (1990) 26:135–147CrossrefGoogle Scholar
  • Dawande M., Geismar H. N., Hall N. G., Sriskandarajah C. Supply chain scheduling: Distribution systems. Production Oper. Management (2006) 15:243–261CrossrefGoogle Scholar
  • Dobson G., Karmarkar U. S., Rummel J. L. Batching to minimize flow times on one machine. Management Sci. (1987) 33:784–799LinkGoogle Scholar
  • Hall N. G., Potts C. N. Supply chain scheduling: Batching and delivery. Oper. Res. (2003) 51(4):566–584LinkGoogle Scholar
  • Hall N. G., Potts C. N. The coordination of scheduling and batch deliveries. Ann. Oper. Res. (2005) 135:41–64CrossrefGoogle Scholar
  • Hall N. G., Lesaoana M. A., Potts C. N. Scheduling with fixed delivery dates. Oper. Res. (2001) 49:134–144LinkGoogle Scholar
  • Herrmann J. W., 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–288CrossrefGoogle Scholar
  • Lee C. Y., Chen Z. L. Machine scheduling with transportation considerations. J. Scheduling (2001) 4:3–24CrossrefGoogle Scholar
  • Li C.-L., Vairaktarakis G., Lee C.-Y. Machine scheduling with deliveries to multiple customer locations. Eur. J. Oper. Res. (2005) 164:39–51CrossrefGoogle Scholar
  • Mason A. J., Anderson E. J. Minimizing flow time on a single machine with job classes and setup times. Naval Res. Logist. (1991) 38:333–350CrossrefGoogle Scholar
  • Monma C. L., Potts C. N. On the complexity of scheduling with batch setup times. Oper. Res. (1989) 37:798–804LinkGoogle Scholar
  • Naddef D., Santos C. One-pass batching algorithms for the one machine problem. Discrete Appl. Math. (1988) 21:133–145CrossrefGoogle Scholar
  • Potts C. N., Kovalyov M. Y. Scheduling with batching: A review. Eur. J. Oper. Res. (2000) 120:228–249CrossrefGoogle Scholar
  • Potts C. N., Van Wassenhove L. N. Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity. J. Oper. Res. Soc. (1992) 43:395–406CrossrefGoogle Scholar
  • Santos C., Magazine M. Batching in single operation manufacturing systems. Oper. Res. Lett. (1985) 4:99–103CrossrefGoogle Scholar
  • Selvarajah E., Steiner G. Batch scheduling in a two-level supply chain: A focus on the supplier. Eur. J. Oper. Res. (2006) 173:226–240CrossrefGoogle Scholar
  • Shallcross D. F. A polynomial algorithm for a one machine batching problem. Oper. Res. Lett. (1992) 11:213–218CrossrefGoogle Scholar
  • Thomas D. J., Griffin P. M. Coordinated supply chain management. Eur. J. Oper. Res. (1996) 94:1–15CrossrefGoogle Scholar
  • Webster S., Baker K. R. Scheduling groups of jobs on a single machine. Oper. Res. (1995) 43:692–703LinkGoogle Scholar
  • Williams J. F. A hybrid algorithm for simultaneous scheduling of production and distribution in multi-echelon structures. Management Sci. (1983) 29:77–92LinkGoogle Scholar
  • Yang X. Scheduling with generalized batch delivery dates and earliness penalties. IIE Trans. (2000) 32:735–741CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.