東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back to Search results for [ null ]

Switch To: Labeled | MARC Mode | ISBD

Optimization of die storage location...

Gupta, Tushar.

Linked to FindBook

Google Book

Amazon

博客來

Optimization of die storage location considering travel distance and time: A case study of an automotive parts stamping shop.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Optimization of die storage location considering travel distance and time: A case study of an automotive parts stamping shop./
Author:	Gupta, Tushar.
Description:	81 p.
Notes:	Source: Masters Abstracts International, Volume: 53-01.
Contained By:	Masters Abstracts International53-01(E).
Subject:	Mechanical engineering. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1556517
ISBN:	9781303919596

Optimization of die storage location considering travel distance and time: A case study of an automotive parts stamping shop.
Gupta, Tushar.

Optimization of die storage location considering travel distance and time: A case study of an automotive parts stamping shop. - 81 p.

Source: Masters Abstracts International, Volume: 53-01.

Thesis (M.S.)--The University of Texas at San Antonio, 2014.

This item must not be sold to any third party vendors.

Every company seeks to have high volumes of production and distribution, using optimal allocation of stock inventories. The layout of warehouses is one of the important factors affecting the efficiency of the warehouse operations. The success of a manufacturing organization depends on the proper design of facilities supporting all production cycles. Out of all processes, order picking and restocking are receiving more attention, as they have been considered as very labor-intensive and costly operations. The assignment of stocks to locations is one of the most important issues that must be resolved in manufacturing system. The purpose of this research is to develop a dynamic die location planning system with the objective of reducing the overall stamping die handler's travel distance and time on the monthly basis. This research addresses a real warehouse logistic problem of an automotive stamping shop that performs picking and restocking of die sets with the attempt to generate an optimal layout for all die sets that will minimize the aggregate walking distance of operators handling the overhead crane. Given a set of production orders for die sets and their picking frequencies, the assignment of die sets to storage location is formulated as a 0-1 Linear Integer Programming model (LIP). Optimal solution is generated with minimum run time by using LINGO version 14.0 software solutions derived from using heuristic algorithms are used to demonstrate the effectiveness of the proposed LIP model.

ISBN: 9781303919596Subjects--Topical Terms:

649730
Mechanical engineering.

Optimization of die storage location considering travel distance and time: A case study of an automotive parts stamping shop.
LDR:02516nmm a2200301 4500 001 2063958
005 20151106144747.5
008 170521s2014 ||||||||||||||||| ||eng d
020 $a 9781303919596
035 $a (MiAaPQ)AAI1556517
035 $a AAI1556517
040 $a MiAaPQ $c MiAaPQ
100 1 $a Gupta, Tushar. $3 3178512
245 1 0 $a Optimization of die storage location considering travel distance and time: A case study of an automotive parts stamping shop.
300 $a 81 p.
500 $a Source: Masters Abstracts International, Volume: 53-01.
500 $a Adviser: Dr. F. Frank Chen.
502 $a Thesis (M.S.)--The University of Texas at San Antonio, 2014.
506 $a This item must not be sold to any third party vendors.
520 $a Every company seeks to have high volumes of production and distribution, using optimal allocation of stock inventories. The layout of warehouses is one of the important factors affecting the efficiency of the warehouse operations. The success of a manufacturing organization depends on the proper design of facilities supporting all production cycles. Out of all processes, order picking and restocking are receiving more attention, as they have been considered as very labor-intensive and costly operations. The assignment of stocks to locations is one of the most important issues that must be resolved in manufacturing system. The purpose of this research is to develop a dynamic die location planning system with the objective of reducing the overall stamping die handler's travel distance and time on the monthly basis. This research addresses a real warehouse logistic problem of an automotive stamping shop that performs picking and restocking of die sets with the attempt to generate an optimal layout for all die sets that will minimize the aggregate walking distance of operators handling the overhead crane. Given a set of production orders for die sets and their picking frequencies, the assignment of die sets to storage location is formulated as a 0-1 Linear Integer Programming model (LIP). Optimal solution is generated with minimum run time by using LINGO version 14.0 software solutions derived from using heuristic algorithms are used to demonstrate the effectiveness of the proposed LIP model.
590 $a School code: 1283.
650 4 $a Mechanical engineering. $3 649730
650 4 $a Automotive engineering. $3 2181195
650 4 $a Engineering. $3 586835
690 $a 0548
690 $a 0540
690 $a 0537
710 2 $a The University of Texas at San Antonio. $b Mechanical Engineering. $3 2103934
773 0 $t Masters Abstracts International $g 53-01(E).
790 $a 1283
791 $a M.S.
792 $a 2014
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1556517