Abstract
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 due-date-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.
Recommended Citation
Zhang, Jian and Tu, Yiliu, "OKP Supply Chain Scheduling" (2012). WHICEB 2012 PROCEEDINGS. 23.
https://aisel.aisnet.org/whiceb2011/23
COinS