A Novel Hybrid Dynamic Programming Algorithm for a Two-Stage Supply Chain Scheduling Problem

  • Jun Pei
  • Xinbao Liu
  • Wenjuan Fan
  • Panos M. Pardalos
  • Lin Liu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8426)

Abstract

This study addresses a two-stage supply chain scheduling problem, where the jobs need to be processed on the manufacturer’s serial batching machine and then transported by vehicles to the customer for further processing. The size and processing time of the jobs are varying due to the differences of types, and setup time is needed before processing one batch. For the problem with minimizing the makespan, we formalize it as a mixed integer programming model. In addition, the structural properties and lower bound of the problem are provided. Based on the analysis above, a novel hybrid dynamic programming algorithm, combining dynamic programming and heuristics, is proposed to solve the problem. Furthermore, its time complexity is also analyzed. By comparing the experimental results of our proposed algorithm with the heuristics \(BFF\) and \(LFF\), we demonstrate that our proposed algorithm has better performance and can solve the problem in a reasonable time.

Keywords

Supply chain scheduling Batching Dynamic programming Heuristic algorithm 

Notes

Acknowledgements

This work is supported by the National Natural Science Foundation of China (Nos. 71231004, 71171071, 71131002). Panos M. Pardalos is partially supported by LATNA laboratory, NRU HSE, RF government grant, ag. 11.G34.31.0057.

References

  1. 1.
    Hall, N.G., Potts, C.N.: Supply chain scheduling: batching and delivery. Oper. Res. 51(4), 566–584 (2003)CrossRefMATHMathSciNetGoogle Scholar
  2. 2.
    Alcali, E., Geunes, J., Pardalos, P.M., Romeijn, H.E., Shen, Z.J.: Applications of Supply Chain Management and E-commerce Research in Industry. Kluwer Academic Publishers, Dordrecht (2004)Google Scholar
  3. 3.
    Gordon, V.S., Strusevich, V.A.: Single machine scheduling and due date assignment with positionally dependent processing times. Eur. J. Oper. Res. 198(1), 57–62 (2009)CrossRefMATHMathSciNetGoogle Scholar
  4. 4.
    Cheng, T.C.E., Wang, X.: Machine scheduling with job class setup and delivery considerations. Comput. Oper. Res. 37(6), 1123–1128 (2010)CrossRefMATHMathSciNetGoogle Scholar
  5. 5.
    Li, S., Ng, C.T., Cheng, T.C.E., Yuan, J.: Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan. Eur. J. Oper. Res. 210(3), 482–488 (2011)CrossRefMATHMathSciNetGoogle Scholar
  6. 6.
    Yeung, W.K., Choi, T.M., Cheng, T.C.E.: Supply chain scheduling and coordination with dual delivery modes and inventory storage cost. Int. J. Prod. Econ. 132(2), 223–229 (2011)CrossRefGoogle Scholar
  7. 7.
    Hwang, F.J., Kovalyov, M.Y., Lin, B.M.T.: Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence. Discret. Optim. 9(1), 29–39 (2012)CrossRefMATHMathSciNetGoogle Scholar
  8. 8.
    Hwang, F.J., Lin, B.M.T.: Two-stage assembly-type flowshop batch scheduling problem subject to a fixed job sequence. J. Oper. Res. Soc. 63(6), 839–845 (2012)CrossRefGoogle Scholar
  9. 9.
    Geunes, J., Pardalos, P.M.: Supply Chain Optimization. Kluwer Academic Publishers, Dordrecht (2003)Google Scholar
  10. 10.
    Agrawal, V., Chao, X., Seshadri, S.: Dynamic balancing of inventory in supply chains. Eur. J. Oper. Res. 159(2), 296–317 (2004)CrossRefMATHMathSciNetGoogle Scholar
  11. 11.
    Pardalos, P.M., Shylo, O.V., Vazacopoulos, A.: Solving job shop scheduling problems utilizing the properties of backbone and “big valley”. Comput. Optim. Appl. 47(1), 61–76 (2010)CrossRefMATHMathSciNetGoogle Scholar
  12. 12.
    Gong, H., Tang, L.: Two-machine flowshop scheduling with intermediate transportation under job physical space consideration. Comput. Oper. Res. 38(9), 1267–1274 (2011)CrossRefMATHMathSciNetGoogle Scholar
  13. 13.
    Averbakh, I., Xue, Z.: On-line supply chain scheduling problems with preemption. Eur. J. Oper. Res. 181(1), 500–504 (2007)CrossRefMATHGoogle Scholar
  14. 14.
    Kim, H., Jeong, H., Park, J.: Integrated model for production planning and scheduling in a supply chain using benchmarked genetic algorithm. Int. J. Adv. Manuf. Technol. 39(11), 1207–1226 (2008)CrossRefGoogle Scholar
  15. 15.
    You, P.S., Hsieh, Y.C.: A heuristic approach to a single stage assembly problem with transportation allocation. Appl. Math. Comput. 218(22), 11100–11111 (2012)CrossRefMATHMathSciNetGoogle Scholar
  16. 16.
    Mehravaran, Y., Logendran, R.: Non-permutation flowshop scheduling in a supply chain with sequence-dependent setup times. Int. J. Prod. Econ. 135(2), 953–963 (2012)CrossRefGoogle Scholar
  17. 17.
    Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic machine scheduling: a survey. Ann. Discret. Math. 5, 287–326 (1979)CrossRefMATHMathSciNetGoogle Scholar
  18. 18.
    Gottlieb, J., Raidl, G.R. (eds.): EvoCOP 2006. LNCS, vol. 3906. Springer, Heidelberg (2006)Google Scholar
  19. 19.
    Koh, S.G., Koo, P.H., Kim, D.C., Hur, W.S.: Scheduling a single batch processing machine with arbitrary job sizes and incompatible job families. Int. J. Prod. Econ. 98(1), 81–96 (2005)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Jun Pei
    • 1
    • 2
  • Xinbao Liu
    • 1
    • 3
  • Wenjuan Fan
    • 1
    • 4
  • Panos M. Pardalos
    • 2
  • Lin Liu
    • 1
    • 3
  1. 1.School of ManagementHefei University of TechnologyHefeiChina
  2. 2.Center for Applied Optimization, Department of Industrial and Systems EngineeringUniversity of FloridaGainesvilleUSA
  3. 3.Key Laboratory of Process Optimization and Intelligent Decision-making of Ministry of EducationHefeiChina
  4. 4.Department of Computer ScienceNorth Carolina State UniversityRaleighUSA

Personalised recommendations