Supply Chain Scheduling with Transportation Cost on a Single Machine

Abstract:

Supply chain scheduling problem is raised from modern manufacturing system integration, in which manufacturers not only process orders but also transport products to customer’s location. Therefore, the system ought to consider how to appropriately send finished jobs in batches to reduce transportation costs while considering the processing sequence of jobs to reduce production cost. This paper studies such a supply chain scheduling problem that one manufacturer produces with a single machine and deliveries jobs within limited transportation times to one customer. The objective function is to minimize the total sum of production cost and transportation cost. The NP hard property of the problem is proved in the simpler way, and the pseudo-dynamic programming algorithm in the literature is modified as the MDP algorithm to get the optimal solution which is associated with the total processing times of jobs.

• Periodical: Advanced Materials Research (Volume 382)
• Pages: 106-109
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.382.106
• Online since: November 2011
• Authors: Jing Fan
• Keywords: Manufacturing Systems Integration, NP-Hard, Pseudo-Polynomial Dynamic Programming Algorithm, Supply Chain Scheduling, Transportation Cost

References

[1] C.Y. Lee, Z.L. Chen: Machine scheduling with transportation considerations, J. Schedul. Vol. 4 (2001), p.3–24.

[2] C.Y. Lee, V.A. Strusevich: Two-machine shop scheduling with an uncapacited interstage transporter, IIE Trans. Vol. 37 (2005), p.725–736.

DOI: 10.1080/07408170590918290

[3] Y.C. Chang, C.Y. Lee: Machine scheduling with job delivery coordination, Eur. J. Oper. Res. Vol. 158 (2004), p.470–487.

[4] W.Y. Zhong, G. Dosa, Z.Y. Tan: On the machine scheduling problem with job delivery coordination, Eur. J. Oper. Res. Vol. 182 (2007), p.1057–1072.

[5] G. Pundoor, Z.L. Chen: Scheduling a production–distribution system to optimize the tradeoff between delivery tardiness and distribution cost, Naval Res. Logis. Vol. 52 (2005), p.571–589.

DOI: 10.1002/nav.20100

[6] T.C.E. Cheng, H.G. Kahlbacher: Scheduling with delivery and earliness penalties, Asia-Pacific J. Oper. Res. Vol. 10 (1993), p.145–152.

[7] N.G. Hall, C.N. Potts: Supply chain scheduling: batching and delivery, Oper. Res. Vol. 51 (2003), p.566–584.

DOI: 10.1287/opre.51.4.566.16106

[8] T.C.E. Cheng, M.Y. Kovalyov, B.M.T. Lin: Single machine scheduling to minimize batch delivery and job earliness penalties, SIAM J, Optim, Vol. 7 (1997), pp.547-559.

DOI: 10.1137/s1052623494269540

[9] N.G. Hall, C.N. Potts: The coordination of scheduling and batch deliveries, Ann. Oper. Res. Vol. 135 (2005), p.41–64.

DOI: 10.1007/s10479-005-6234-8

[10] G. Wang, T.C.E. Cheng: Parallel machine scheduling with batch delivery costs, Int. J. Prod. Econom. Vol. 68 (2005), p.177–183.

[11] M. Ji, Y. He, T.C.E. Cheng: Batch delivery scheduling with batch delivery cost on a single machine, Eur. J. Oper. Res. Vol. 176(2007), p.745–755.

DOI: 10.1016/j.ejor.2005.09.006

[12] Z.L. Chen: Integrated production and outbound distribution scheduling: Review and extensions. Oper. Res. Vol. 58(2010), p.130–148.