A Novel Hybrid Dynamic Programming Algorithm for a Two-Stage Supply Chain Scheduling Problem
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.
KeywordsSupply chain scheduling Batching Dynamic programming Heuristic algorithm
- 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
- 9.Geunes, J., Pardalos, P.M.: Supply Chain Optimization. Kluwer Academic Publishers, Dordrecht (2003)Google Scholar
- 18.Gottlieb, J., Raidl, G.R. (eds.): EvoCOP 2006. LNCS, vol. 3906. Springer, Heidelberg (2006)Google Scholar