Determining the shortest path for inner transportation in warehouse by dynamic programming method / Nurdiana Mohd Razif, Nurul Najiha Mohammed Hairul and Ungku Sofi Dayana Ungku Iskandar Zukarnine
This study was conducted to detennine the shortest path for an order picker to collect all of the ordered items in a warehouse. This study focusing only on one forklift. Dynamic Programming Method was chosen to conduct this study in order to solve the shortest path problem. The shortest path problem...
Saved in:
| Main Authors: | , , |
|---|---|
| 格式: | Student Project |
| 語言: | English |
| 出版: |
2019
|
| 主題: | |
| 在線閱讀: | http://ir.uitm.edu.my/id/eprint/39475/1/39475.pdf http://ir.uitm.edu.my/id/eprint/39475/ |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
成為第一個發表評論!