Skip to main content
Log in

Batching Scheduling in a Two-Level Supply Chain with Earliness and Tardiness Penalties

  • Published:
Journal of Systems Science and Complexity Aims and scope Submit manuscript

Abstract

This paper studies the batch sizing scheduling problem with earliness and tardiness penalties which is closely related to a two-level supply chain problem. In the problem, there are K customer orders, where each customer order consisting of some unit length jobs has a due date. The jobs are processed in a common machine and then delivered to their customers in batches, where the size of each batch has upper and lower bounds and each batch may incur a fixed setup cost which can also be considered a fixed delivery cost. The goal is to find a schedule which minimizes the sum of the earliness and tardiness costs and the setup costs incurred by creating a new batch. The authors first present some structural properties of the optimal schedules for single-order problem with an additional assumption (a): The jobs are consecutively processed from time zero. Based on these properties, the authors give a polynomial-time algorithm for single-order problem with Assumption (a). Then the authors give dynamic programming algorithms for some special cases of multiple-order problem with Assumption (a). At last, the authors present some structural properties of the optimal schedules for single-order problem without Assumption (a) and give a polynomial-time algorithm for it.

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

Access this article

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

  1. Santos C A and Magazine M J, Batching in single operation manufacturing systems, Operations Research Letters, 1985, 4: 99–103.

    Article  MATH  Google Scholar 

  2. Allahverdi A, Ng C T, Cheng T C E, and Kovalyov M Y, A survey of scheduling problems with setup times or costs, European Journal of Operational Research, 2008, 187: 985–1032.

    Article  MathSciNet  MATH  Google Scholar 

  3. Potts C N and Kovalyov M Y, Scheduling with batching: A review, European Journal of Operational Research, 2000, 120: 228–249.

    Article  MathSciNet  MATH  Google Scholar 

  4. Sung C S and Joo U G, Batching to minimize weighted mean flow time on a single machine with size restrictions, Computers and Industrial Engineering, 1997, 32: 333–340.

    Article  Google Scholar 

  5. Cheng T C E and Kovalyov M Y, Single machine batch scheduling with sequential processing, IIE Transactions, 2001, 33: 413–420.

    Google Scholar 

  6. Hall N G and Potts C N, Supply chain scheduling: Batching and delivery, Operations Research, 2003, 51: 566–584.

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  8. Yasaman M and Rasaratnam L, Non-permutation flowshop scheduling in a supply chain with sequence-dependent setup times, International Journal of Production Economics, 2012, 135: 953–963.

    Article  Google Scholar 

  9. Ivanov D and Sokolov B, Dynamic supply chain scheduling, Journal of Scheduling, 2012, 15: 201–216.

    Article  MathSciNet  MATH  Google Scholar 

  10. Low C, Li R K, and Chang C M, Integrated scheduling of production and delivery with time windows, International Journal of Production Research, 2012, 51(3): 897–909.

    Article  Google Scholar 

  11. Wang X and Cheng T C E, Production scheduling with supply and delivery considerations to minimize the makespan, European Journal of Operational Research, 2009, 194: 743–752.

    Article  MathSciNet  MATH  Google Scholar 

  12. Wang X and Cheng T C E, Logistics scheduling to minimize inventory and transport costs, International Journal of Production Economics, 2009, 121: 266–273.

    Article  Google Scholar 

  13. Baker K R and Scudder G D, Sequencing with earliness and tardiness penalties: A review, Operations Research, 1990, 38: 22–36.

    Article  MathSciNet  MATH  Google Scholar 

  14. Laguna M and Velatde J L G, A search heuristic for just-in-time scheduling in parallel machines, Journal of Intelligent Manufacturing, 1991, 2: 253–260.

    Article  Google Scholar 

  15. Chen Z L and Powell W B, A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem, European Journal of Operational Research, 1999, 116: 220–232.

    Article  MATH  Google Scholar 

  16. Cheng T C E and Chen Z L, Parallel-machine scheduling problems with earliness and tardiness penalties, The Journal of the Operational Research Society, 1994, 45: 685–695.

    Article  MATH  Google Scholar 

  17. De P, Ghosh J B, and Wells C E, Due-date assignment and early/tardy scheduling on identical parallel machines, Naval Research Logistics, 1994, 41: 17–32.

    Article  MathSciNet  MATH  Google Scholar 

  18. Chrétienne P, Hazir Ö, and Kedad-Sidhoum S, Integrated batch sizing and scheduling on a single machine, Journal of Scheduling, 2011, 14: 541–555.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Erfang Shan.

Additional information

This research was supported by the National Nature Science Foundation of China under Grant Nos. 11471210 and 11171207, the Natural Science Foundation of Ningbo City under Grant No. 2015A610168 and the Natural Science Foundation of Zhejiang Province of China under Grant No. LQl3A010010.

This paper was recommended for publication by Editor WANG Shouyang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wei, Q., Kang, L. & Shan, E. Batching Scheduling in a Two-Level Supply Chain with Earliness and Tardiness Penalties. J Syst Sci Complex 29, 478–498 (2016). https://doi.org/10.1007/s11424-015-3330-y

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11424-015-3330-y

Keywords

Navigation