OKP Supply Chain Scheduling

摘要：

In one-of-a-kind production (OKP), a firm usually keeps zero stock for some components of which the demand is unstable. In this work, we model the scheduling problem for the OKP firm who promises duedate-guaranteed delivery to its customers. The firm schedules its jobs to minimize its total cost concerning the constraint of components delivery from its supplier. We develop a pair-wise scheduling algorithm to model. The simulation test shows that the proposed pair-wise scheduling algorithm can find the near optimal solution.

关键词： one-of-a-kind production supply chain scheduling pair-wise algorithm

作者: Jian Zhang Yiliu Tu

作者单位: Department of Mechanical & Manufacturing, University of Calgary, Canada

会议类型: 国际会议

会议名称: The Eleventh Wuhan International Conference on E-Business(第十一届武汉电子商务国际会议)

会议地点: 武汉

会议语种:英文

页码: 707-713

在线出版日期: 2012-05-26（万方平台首次上网日期，不代表论文的发表时间）