Name
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. |
Year | Venue | Keywords |
|---|---|---|
2012 | ELEVENTH WUHAN INTERNATIONAL CONFERENCE ON E-BUSINESS | one-of-a-kind production,supply chain scheduling,pair-wise algorithm |
Field | DocType | Citations |
Mathematical optimization,Job shop scheduling,Supply chain scheduling,Scheduling (computing),Computer science,Schedule,Total cost,Distributed computing | Conference | 0 |
PageRank | References | Authors |
0.34 | 6 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jian Zhang | 1 | 6 | 2.50 |
| Yiliu Tu | 2 | 111 | 15.46 |