Skip to main content
SpringerLink
Log in

The Coordination of Scheduling and Batch Deliveries

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

This paper considers several scheduling problems where deliveries are made in batches with each batch delivered to the customer in a single shipment. Various scheduling costs, which are based on the delivery times of the jobs, are considered. The objective is to minimize the scheduling cost plus the delivery cost, and both single and parallel machine environments are considered. For many combinations of these, we either provide efficient algorithms that minimize total cost or show that the problem is intractable. Our work has implications for the coordination of scheduling with batch delivery decisions to improve customer service.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Albers, S. and P. Brucker. (1993). “The Complexity of One-Machine Batching Problems.” Discrete Applied Mathematics 47, 87–107.

    Article  Google Scholar 

  • Bruno, J. and P. Downey. (1978). “Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs.” SIAM Journal on Computing 7, 393–404.

    Article  Google Scholar 

  • Cheng, T.C.E., V.S. Gordon, and M.Y. Kovalyov. (1996). “Single Machine Scheduling with Batch Deliveries.” European Journal of Operational Research 94, 277–283.

    Article  Google Scholar 

  • Du, J. and J.Y.-T. Leung. (1990). “Minimizing Total Tardiness on One Machine is NP-Hard.” Mathematics of Operations Research 15, 483–495.

    Google Scholar 

  • Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: W.H. Freeman.

    Google Scholar 

  • Graham, R.L., E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan. (1979). “Optimization and Approximation in Deterministic Machine Scheduling: A Survey.” Annals of Discrete Mathematics 5, 287–326.

    Google Scholar 

  • Hall, N.G., M.A. Lesaoana, and C.N. Potts. (2001). “Scheduling with Fixed Delivery Dates.” Operations Research 49, 854–865.

    Article  Google Scholar 

  • Hall, N.G. and C.N. Potts. (2003). “Supply Chain Scheduling: Batching and Delivery.” Operations Research 51, 566–584.

    Article  Google Scholar 

  • Ham, I., K. Hitomi, and T. Yoshida. (1985). Group Technology: Applications to Production Management. Boston, MA: Kluwer-Nijhoff.

    Google Scholar 

  • Herrmann, J. and C.-Y. Lee. (1993). “On Scheduling to Minimize Earliness-Tardiness and Batch Delivery Costs with a Common Due Date.” European Journal of Operational Research 70, 272–288.

    Article  Google Scholar 

  • Karp, R.M. (1972). “Reducibility among Combinatorial Problems.” In R.E. Miller and J.W. Thatcher (eds.), Complexity of Computer Computations. New York: Plenum Press, pp. 85–103.

    Google Scholar 

  • Kruse, R.L. (1987). Data Structures and Program Design, 2nd ed. Englewood Cliffs, NJ: Prentice-Hall.

    Google Scholar 

  • Lawler, E.L. (1977). “A ‘Pseudopolynomial’ Time Algorithm for Sequencing Jobs to Minimize Total Tardiness.” Annals of Discrete Mathematics 1, 331–342.

    Google Scholar 

  • Lee, C.-Y. and Z.-L. Chen. (2001). “Machine Scheduling with Transportation Considerations.” Journal of Scheduling 4, 3–24.

    Article  Google Scholar 

  • Lee, C.-Y., R. Uzsoy, and L.A. Martin-Vega. (1992). “Efficient Algorithms for Scheduling Semiconductor Burn-in Operations.” Operations Research 40, 764–775.

    Google Scholar 

  • Lenstra, J.K., A.H.G. Rinnooy Kan, and P. Brucker. (1977). “Complexity of Machine Scheduling Problems.” Annals of Discrete Mathematics 1, 343–362.

    Article  Google Scholar 

  • Monma, C.L. and C.N. Potts. (1989). “On the Complexity of Scheduling with Batch Setup Times.” Operations Research 37, 798–804.

    Article  Google Scholar 

  • Moore, J.M. (1968). “An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs.” Management Science 15, 102–109.

    Google Scholar 

  • Potts, C.N. and M.Y. Kovalyov. (2000). “Scheduling with Batching: A Review.” European Journal of Operational Research 120, 228–249.

    Article  Google Scholar 

  • Potts, C.N. and L.N. Van Wassenhove. (1992). “Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity.” Journal of the Operational Research Society 43, 395–406.

    Google Scholar 

  • Webster, S. and K.R. Baker. (1995). “Scheduling Groups of Jobs on a Single Machine.” Operations Research 43, 692–703.

    Google Scholar 

  • Yang, X. (2000). “Scheduling with Generalized Batch Delivery Dates and Earliness Penalties.” IIE Transactions 32, 735–742.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fisher College of Business, The Ohio State University, 2100 Neil Avenue, Columbus, Ohio, OH, 43210-1144, USA

    Nicholas G. Hall

  2. School of Mathematics, University of Southampton, Southampton, SO 17 1BJ, UK

    Chris N. Potts

Authors
  1. Nicholas G. Hall
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chris N. Potts
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nicholas G. Hall.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hall, N.G., Potts, C.N. The Coordination of Scheduling and Batch Deliveries. Ann Oper Res 135, 41–64 (2005). https://doi.org/10.1007/s10479-005-6234-8

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-005-6234-8

Keywords

Search

Navigation