Name
Abstract | ||
|---|---|---|
Motivated by scheduling challenges in back-end semiconductor manufacturing, we propose a framework to oversee and integrate
local decentralized scheduling algorithms utilized in complex supply chain manufacturing networks. We fill the gap between
higher-level production planning and lower-level scheduling by establishing short-term production targets and priority scores
for each product at each step in the system. Given a target output schedule, target cycle times for each step, the process
and product structure, and initial WIP status, short-term production targets for each product/step are set. These targets
can be used to evaluate the system performance and guide decentralized schedulers to control the system so as to achieve desirable
outputs in dynamic environments. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/s10479-006-0148-y | Annals OR |
Keywords | Field | DocType |
Supply chain management,Manufacturing,Scheduling,Decentralized scheduler | Fixed-priority pre-emptive scheduling,Mathematical optimization,Fair-share scheduling,Real-time computing,Scheduling (production processes),Supply chain management,Production planning,Rate-monotonic scheduling,Dynamic priority scheduling,Mathematics,Round-robin scheduling,Distributed computing | Journal |
Volume | Issue | ISSN |
161 | 1 | 0254-5330 |
Citations | PageRank | References |
3 | 0.51 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Payman Jula | 1 | 26 | 2.73 |
| Robert C. Leachman | 2 | 77 | 10.00 |