Name
Title | ||
|---|---|---|
On the complexity of short-term production planning and the near-optimality of a sequential assignment problem heuristic approach |
Abstract | ||
|---|---|---|
In semiconductor manufacturing, the process of short-term production planning requires setting clear and yet challenging and doable goals to each operation and toolset in the process flow per each product type. We demonstrate the complexity of this problem using an experimental study performed with proficient workforce, and then show how the problem can be decomposed, aggregated, and solved using sequential recurrent linear programming assignment problems. We also refer to the improvements that the proposed algorithm has achieved in practice when applied to multiple semiconductor production facilities, and discuss its efficiency and uniqueness as a fast heuristic relative to other proposed methods. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.cie.2013.05.005 | Computers & Industrial Engineering |
Keywords | Field | DocType |
sequential assignment problem heuristic,product type,doable goal,process flow,assignment problem,semiconductor manufacturing,experimental study,proposed algorithm,multiple semiconductor production facility,short-term production planning,optimization | Weapon target assignment problem,Uniqueness,Mathematical optimization,Heuristic,Generalized assignment problem,Assignment problem,Production planning,Linear programming,Engineering,Linear bottleneck assignment problem,Operations management | Journal |
Volume | Issue | ISSN |
65 | 4 | 0360-8352 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Adar Kalir | 1 | 0 | 1.69 |
| Yonatan Zorea | 2 | 0 | 0.34 |
| Adir Pridor | 3 | 0 | 0.68 |
| Lev Bregman | 4 | 9 | 3.34 |