Skip to main content
SpringerLink
Log in

Batch sizing and just-in-time scheduling with common due date

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

Abstract

In this paper, we address the optimal batch sizing and just-in-time scheduling problem where upper and lower bounds on the size of the batches are imposed. The objective is to find a feasible schedule that minimizes the sum of the weighted earliness and tardiness penalties as well as the setup costs, which involves the cost of creating a new batch. We present some structural properties of the optimal schedules and describe solving algorithms for the single machine problem.

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

Fig. 1
Algorithm 1
Algorithm 2
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  • Azizoglu, M., & Webster, S. (1997). Scheduling job families about an unrestricted common due date on a single machine. International Journal of Production Research, 35(5), 1321–1330.

    Article  Google Scholar 

  • Chang, J. H., & Chiu, H. N. (2005). A comprehensive review of lot-streaming. International Journal of Production Research, 43(8), 1515–1536.

    Article  Google Scholar 

  • Chen, Z. L. (1996). Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs. European Journal of Operational Research, 93, 49–60.

    Article  Google Scholar 

  • Cheng, T. C. E., & Kovalyov, M. Y. (2001). Single machine batch scheduling with sequential processing. IIE Transactions, 33, 413–420.

    Google Scholar 

  • Chrétienne, P., Hazir, O., & Kedad-Sidhoum, S. (2011). Integrated lot-streaming an scheduling on a single machine. Journal of Scheduling, 14(6), 541–555.

    Article  Google Scholar 

  • Coffman, E. G., Yannakakis, M., Magazine, M. J., & Santos, C. A. (1990). Batch sizing and job sequencing on a single machine. Annals of Operations Research, 26, 135–147.

    Article  Google Scholar 

  • Hall, N. G., & Potts, C. N. (2003). Supply chain scheduling: batching and delivery. Operations Research, 51(4), 566–584.

    Article  Google Scholar 

  • Hall, N. G., & Potts, C. N. (2005). The coordination of scheduling and batch deliveries. Annals of Operations Research, 135, 41–64.

    Article  Google Scholar 

  • Hendel, Y., Runge, N., & Sourd, F. (2009). The one-machine just-in-time scheduling problem with preemptions. Discrete Optimization, 6(1), 10–22.

    Article  Google Scholar 

  • Hermann, J. W., & Lee, C. L. (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 

  • Jozefowska, J. (2007). Just-in-time scheduling models and algorithms for computer and manufacturing systems (1st ed.). New York: Springer.

    Google Scholar 

  • Logendran, R., & Subur, F. (2004). Unrelated parallel machine scheduling with job splitting. IIE Transactions, 36, 359–372.

    Article  Google Scholar 

  • Potts, C. N., & Kovalyov, M. Y. (2000). Scheduling with batching: a review. European Journal of Operational Research, 120(2) 228–249.

    Article  Google Scholar 

  • Potts, C. N., & Van Wassenhove, L. N. (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 

  • Rachamadugu, R. (1995). Scheduling jobs with proportionate early/tardy penalties. IIE Transactions, 27, 679–682.

    Article  Google Scholar 

  • Robert, A. (2007). Optimization des batches de production. PhD thesis, Université Pierre et Marie Curie (Paris 6).

  • Santos, C. A., & Magazine, M. J. (1985). Batching in single operation manufacturing systems. Operations Research Letters, 4, 99–103.

    Article  Google Scholar 

  • Selvarajah, E., & Steiner, G. (2006). Batch scheduling in a two-level supply chain: a focus on the supplier. European Journal of Operational Research, 173, 226–240.

    Article  Google Scholar 

  • Serafini, P. (1996). Scheduling jobs on several machines with job splitting property. Operations Research, 44, 617–628.

    Article  Google Scholar 

  • Shim, S. O., & Kim, Y. A. (2008). A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property. Computers & Operations Research, 35, 863–875.

    Article  Google Scholar 

  • Sun, H., & Wang, G. (2003). Parallel machine earliness and tardiness scheduling with proportional weights. Computers & Operations Research, 30, 801–808.

    Article  Google Scholar 

  • T’kindt, V. (2010). Multicriteria models for just-in-time scheduling. International Journal of Production Research, 49(11), 3191–3209.

    Google Scholar 

  • Xing, W., & Zhang, J. (2000). Parallel machine scheduling with splitting jobs. Discrete Applied Mathematics, 103, 259–269.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. TED Üniversitesi, Ziya Gökalp Caddesi No. 48 06420, Kolej Cankaya, Ankara, Turkey

    Öncü Hazır

  2. LIP6, Université Pierre et Marie Curie, 4 place Jussieu, 75252, Paris, Cedex 05, France

    Safia Kedad-Sidhoum

Authors
  1. Öncü Hazır
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Safia Kedad-Sidhoum
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Öncü Hazır.

Additional information

This work has been partially financed by ANR under research contract LMCO/UPMC number C076095.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hazır, Ö., Kedad-Sidhoum, S. Batch sizing and just-in-time scheduling with common due date. Ann Oper Res 213, 187–202 (2014). https://doi.org/10.1007/s10479-012-1289-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-012-1289-9

Keywords

Search

Navigation