Storage location assignment problem in a warehouse system
In a warehouse management system, there are a large number of items that needs to be handled efficiently with an emphasis on timely execution andoptimum utilization of storage space. A mathematical model is presented that involves the use of randomized storage and class based storage policy solving...
Main Author: | |
---|---|
Other Authors: | |
Format: | Thesis |
Language: | English |
Published: |
2014
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/55324 |
_version_ | 1826110112299745280 |
---|---|
author | Sushant Gupta. |
author2 | School of Electrical and Electronic Engineering |
author_facet | School of Electrical and Electronic Engineering Sushant Gupta. |
author_sort | Sushant Gupta. |
collection | NTU |
description | In a warehouse management system, there are a large number of items that needs to be handled efficiently with an emphasis on timely execution andoptimum utilization of storage space. A mathematical model is presented that involves the use of randomized storage and class based storage policy solving the storae assignment problem by reducing the transit time. The results are analyzed with the use of two and four forklifts in a warehouse. The thesis examines the robustness of the proposed method using several case studies of different number of forklifts. |
first_indexed | 2024-10-01T02:29:15Z |
format | Thesis |
id | ntu-10356/55324 |
institution | Nanyang Technological University |
language | English |
last_indexed | 2024-10-01T02:29:15Z |
publishDate | 2014 |
record_format | dspace |
spelling | ntu-10356/553242023-07-04T15:35:45Z Storage location assignment problem in a warehouse system Sushant Gupta. School of Electrical and Electronic Engineering Su Rong DRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems In a warehouse management system, there are a large number of items that needs to be handled efficiently with an emphasis on timely execution andoptimum utilization of storage space. A mathematical model is presented that involves the use of randomized storage and class based storage policy solving the storae assignment problem by reducing the transit time. The results are analyzed with the use of two and four forklifts in a warehouse. The thesis examines the robustness of the proposed method using several case studies of different number of forklifts. Master of Science (Computer Control and Automation) 2014-02-11T03:40:29Z 2014-02-11T03:40:29Z 2013 2013 Thesis http://hdl.handle.net/10356/55324 en 50 p. application/pdf |
spellingShingle | DRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems Sushant Gupta. Storage location assignment problem in a warehouse system |
title | Storage location assignment problem in a warehouse system |
title_full | Storage location assignment problem in a warehouse system |
title_fullStr | Storage location assignment problem in a warehouse system |
title_full_unstemmed | Storage location assignment problem in a warehouse system |
title_short | Storage location assignment problem in a warehouse system |
title_sort | storage location assignment problem in a warehouse system |
topic | DRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems |
url | http://hdl.handle.net/10356/55324 |
work_keys_str_mv | AT sushantgupta storagelocationassignmentprobleminawarehousesystem |