Skip to main content
Log in

Integrated scheduling of production and distribution for manufacturers with parallel batching facilities

Optimization Letters Aims and scope Submit manuscript

Cite this article


We consider a class of integrated scheduling problems for manufacturers. The manufacturer processes job orders and delivers products to the customer. The objective is to minimize the service span, that is, the period lasting from the time when the order is received to the time when all the products have been delivered to the customer. In the production phase, parallel batch-processing facilities are used to process the jobs. Jobs have arbitrary sizes and processing times. Each facility has a fixed capacity and jobs are processed in batches with the restriction that the total size of jobs in a batch does not exceed the facility capacity. When all the jobs in a batch are completed, the batch is completed. In the distribution phase, the manufacturer uses a vehicle with a fixed capacity to deliver products. The transportation time from the manufacturer to the customer is a constant. Completed products can be delivered in one transfer if the total size does not exceed the vehicle capacity. We first consider the problem where jobs have the same size and arbitrary processing times. We propose approximation algorithms for the problem and we show that a worst-case ratio performance guarantee is respectively 2–1/m. Then we consider the problem where jobs have the same processing time and arbitrary sizes. An approximation algorithm is proposed with an absolute worst-case ratio of 13/7 and an asymptotic worst-case ratio of 11/9. Both the proposed algorithms can be executed in polynomial time.

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


  1. Hall, N.G., Potts, C.N.: Supply chain scheduling: batching and delivery. Oper. Res. 51(4), 566–584 (2003)

    Article  MathSciNet  Google Scholar 

  2. Selvarajah, E., Steiner, G.: Approximation algorithms for the supplier’s supply chain scheduling problem to minimize delivery and inventory holding costs. Oper. Res. 57(2), 426–438 (2009)

    Article  MathSciNet  Google Scholar 

  3. Sawik, T.: Coordinated supply chain scheduling. Int. J. Prod. Econ. 120(2), 437–451 (2009)

    Article  Google Scholar 

  4. Yeung, W.K., Choi, T.M., Cheng, T.C.E.: Supply chain scheduling and coordination with dual delivery models and inventory storage cost. Int. J. Prod. Econ. 132(2), 223–229 (2011)

    Article  Google Scholar 

  5. Azadian, F., Murat, A., Chinnam, R.B.: Integrated production and logistics planning: contract manufacturing and choice of air/surface transportation. Eur. J. Oper. Res. 247(1), 113–123 (2015)

    Article  MathSciNet  Google Scholar 

  6. Chen, Z.L., Vairaktarakis, G.L.: Integrated scheduling of production and distribution operations. Manag. Sci. 51(4), 614–628 (2005)

    Article  Google Scholar 

  7. Amorim, P., Gunther, H., Almada-Lobo, B.: Multi-objective integrated production and distribution planning of perishable products. Int. J. Prod. Econ. 138(1), 89–101 (2012)

    Article  Google Scholar 

  8. Leung, J.Y.-T., Chen, Z.L.: Integrated production and distribution with fixed delivery departure dates. Oper. Res. Lett. 41(3), 290–293 (2013)

    Article  MathSciNet  Google Scholar 

  9. Gao, A., Qi, L., Lei, L.: Integrated batch production and distribution scheduling with limited vehicle capacity. Int. J. Prod. Econ. 160, 13–25 (2015)

    Article  Google Scholar 

  10. Nasiri, G.R., Zolfaghari, R., Davoudpour, H.: An integrated supply chain production–distribution planning with stochastic demands. Comput. Ind. Eng. 77, 35–45 (2014)

    Article  Google Scholar 

  11. Averbakh, I.: On-line integrated production–distribution scheduling problems with capacitated deliveries. Eur. J. Oper. Res. 200(2), 377–384 (2010)

    Article  MathSciNet  Google Scholar 

  12. Pinedo, M.L.: Scheduling: Theory, Algorithms, and Systems, 4th edn. Springer, New York (2012)

    Book  Google Scholar 

  13. Leung, J.Y.-T., Ng, C.T., Cheng, T.C.E.: Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times. Eur. J. Oper. Res. 187(3), 1090–1099 (2008)

    Article  MathSciNet  Google Scholar 

  14. Cheng, B., Cai, J., Yang, S., Hu, X.: Algorithms for scheduling incompatible job families on single batching machine with limited capacity. Comput. Ind. Eng. 75, 116–120 (2014)

    Article  Google Scholar 

  15. Malapert, A., Guret, C., Rousseau, L.: A constraint programming approach for a batch processing problem with non-identical job sizes. Eur. J. Oper. Res. 221(3), 533–545 (2012)

    Article  MathSciNet  Google Scholar 

  16. Pei, J., Liu, X., Pardalos, P.M., Fan, W., Yang, S.: Single machine serial-batching scheduling with independent setup time and deteriorating job processing times. Optim. Lett. 9(1), 91–104 (2015)

    Article  MathSciNet  Google Scholar 

  17. Pei, J., Liu, X., Pardalos, P.M., Li, K., Fan, W., Migdalas, A.: Single-machine serial-batching scheduling with a machine availability constraint, position-dependent processing time, and time-dependent set-up time. Optim. Lett. (2016). doi:10.1007/s11590-016-1074-9

    Article  MATH  Google Scholar 

  18. Mazdeh, M.M., Sarhadi, M., Hindi, K.S.: A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times. Comput. Oper. Res. 35(4), 1099–1111 (2008)

    Article  MathSciNet  Google Scholar 

  19. Jula, P., Leachman, R.C.: Coordinated multistage scheduling of parallel batch-processing machines under multi-resource constraints. Oper. Res. 58(4), 933–947 (2010)

    Article  MathSciNet  Google Scholar 

  20. Parsa, N.R., Karimi, B., Kashan, A.H.: A branch and price algorithm to minimize makespan on a single batch-processing machine with arbitrary job sizes. Comput. Oper. Res. 37(10), 1720–1730 (2010)

    Article  MathSciNet  Google Scholar 

  21. Liu, L.L., Ng, C.T., Cheng, T.C.E.: Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan. Optim. Lett. 8(1), 307–318 (2014)

    Article  MathSciNet  Google Scholar 

  22. Xu, S., Bean, B.C.: Scheduling parallel-machine batch operations to maximize on-time delivery performance. J. Sched. 19(5), 583–600 (2016)

    Article  MathSciNet  Google Scholar 

  23. Chen, Z.L. Integrated production and outbound distribution scheduling: review and extensions. Operations Res. 58(1), 130–148 (2010)

    Article  Google Scholar 

  24. Dosa, G., Tan Z., Tuza, Z., Yan Y., Lányi, C.S. Improved bounds for batch scheduling with nonidentical job sizes. Naval Res. Logist. 61(5), 351–358 (2014)

    Article  MathSciNet  Google Scholar 

Download references


This work is supported by the National Natural Science Foundation of China under Grants 71671055, 71601065, 71331002, 71521001 and 71531008. This work is also supported by Anhui Social Science Foundation under Grants SK2016A0526 and 1607a0202031.

Author information

Authors and Affiliations


Corresponding author

Correspondence to Bayi Cheng.

Rights and permissions

Reprints and Permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Cheng, B., Pei, J., Li, K. et al. Integrated scheduling of production and distribution for manufacturers with parallel batching facilities. Optim Lett 12, 1609–1623 (2018).

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: