Approximation Algorithms for the Supplier's Supply Chain Scheduling Problem to Minimize Delivery and Inventory Holding Costs
Published Online:26 Feb 2009https://doi.org/10.1287/opre.1080.0622
References
- Supply chain scheduling: Sequence coordination. Discrete Appl. Math. (2006) 154:2044–2063Crossref, Google Scholar
- The complexity of one-machine batching problems. Discrete Appl. Math. (1993) 47:87–107Crossref, Google Scholar
- Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs. Eur. J. Oper. Res. (1996) 93:49–60Crossref, Google Scholar
- Scheduling with batch setup times and earliness-tardiness penalties. Eur. J. Oper. Res. (1997) 96:518–537Crossref, Google Scholar
- Supply chain scheduling: Conflict and cooperation in assembly systems. Oper. Res. (2007) 55:1072–1089Link, Google Scholar
- Integrated scheduling of production and distribution operations. Management Sci. (2005) 51:614–628Link, Google Scholar
- Single machine scheduling with batch deliveries. Eur. J. Oper. Res. (1996) 94:277–283Crossref, Google Scholar
- Batch sizing and job sequencing on a single machine. Ann. Oper. Res. (1990) 26:135–147Crossref, Google Scholar
- Supply chain scheduling: Distribution systems. Production Oper. Management (2006) 15:243–261Crossref, Google Scholar
- Batching to minimize flow times on one machine. Management Sci. (1987) 33:784–799Link, Google Scholar
- Supply chain scheduling: Batching and delivery. Oper. Res. (2003) 51(4):566–584Link, Google Scholar
- The coordination of scheduling and batch deliveries. Ann. Oper. Res. (2005) 135:41–64Crossref, Google Scholar
- Scheduling with fixed delivery dates. Oper. Res. (2001) 49:134–144Link, Google Scholar
- 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
- Machine scheduling with transportation considerations. J. Scheduling (2001) 4:3–24Crossref, Google Scholar
- Machine scheduling with deliveries to multiple customer locations. Eur. J. Oper. Res. (2005) 164:39–51Crossref, Google Scholar
- Minimizing flow time on a single machine with job classes and setup times. Naval Res. Logist. (1991) 38:333–350Crossref, Google Scholar
- On the complexity of scheduling with batch setup times. Oper. Res. (1989) 37:798–804Link, Google Scholar
- One-pass batching algorithms for the one machine problem. Discrete Appl. Math. (1988) 21:133–145Crossref, Google Scholar
- Scheduling with batching: A review. Eur. J. Oper. Res. (2000) 120:228–249Crossref, Google Scholar
- Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity. J. Oper. Res. Soc. (1992) 43:395–406Crossref, Google Scholar
- Batching in single operation manufacturing systems. Oper. Res. Lett. (1985) 4:99–103Crossref, Google Scholar
- Batch scheduling in a two-level supply chain: A focus on the supplier. Eur. J. Oper. Res. (2006) 173:226–240Crossref, Google Scholar
- A polynomial algorithm for a one machine batching problem. Oper. Res. Lett. (1992) 11:213–218Crossref, Google Scholar
- Coordinated supply chain management. Eur. J. Oper. Res. (1996) 94:1–15Crossref, Google Scholar
- Scheduling groups of jobs on a single machine. Oper. Res. (1995) 43:692–703Link, Google Scholar
- A hybrid algorithm for simultaneous scheduling of production and distribution in multi-echelon structures. Management Sci. (1983) 29:77–92Link, Google Scholar
- Scheduling with generalized batch delivery dates and earliness penalties. IIE Trans. (2000) 32:735–741Crossref, Google Scholar

