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...
保存先:
| 主要な著者: | , , |
|---|---|
| フォーマット: | Student Project |
| 言語: | English |
| 出版事項: |
2019
|
| 主題: | |
| オンライン･アクセス: | http://ir.uitm.edu.my/id/eprint/39475/1/39475.pdf http://ir.uitm.edu.my/id/eprint/39475/ |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|