Engineering Study Guide: Engineering books and study guides: Electronics: A greedy algorithm to determine the number of transporters in a cyclic electroplating process.(Scheduling & Logistics): An article from: IIE Transactions

Location: Home » Electronics » A greedy algorithm to determine the number of transporters in a cyclic electroplating process.(Scheduling & Logistics): An article from: IIE Transactions

A greedy algorithm to determine the number of transporters in a cyclic electroplating process.(Scheduling & Logistics): An article from: IIE Transactions
	Authors: Ronald Armstrong, Shanhong Gu, Lei Lei Publisher: Institute of Industrial Engineers, Inc. (IIE) Buy New: $5.95 as of 2/10/2012 21:15 MST details In Stock Seller: Amazon.com Format: HTML Language: English (Published) Media: Digital Pages: 24 ASIN: B00096KMFS Publication Date: May 1, 1996 Availability: Available for download now



Editorial Reviews: Product Description This digital document is an article from IIE Transactions, published by Institute of Industrial Engineers, Inc. (IIE) on May 1, 1996. The length of the article is 7135 words. The page length shown above is based on a typical 300-word page. The article is delivered in HTML format and is available in your Amazon.com Digital Locker immediately after purchase. You can view it with any web browser. From the author: This paper presents a local optimization algorithm for minimizing the number of transporters required for material handling in a cyclic processing line. Within a cycle, a given set of transportation operations must be performed. Each operation consists of picking up a work-in-process job at a stage and delivering it to the next stage. The length of time that a job can remain at a particular stage is restricted by a time window. The transporters that perform the operations move on a shared track, and traffic collisions must be avoided during their movements. To avoid traffic collisions, the operations are partitioned into groups, where each group is served by a single transporter. A local optimal solution is obtained when the group sizes are maximized. We show that the duals of the linear programming subproblems formulated in the process of maximizing the group sizes are specially structured shortest-path problems. This leads to an effective search method for the maximization problem. Conditions when the proposed algorithm achieves the global optimal solution are discussed. The algorithm's performance is evaluated on both randomly generated test problems and benchmark problems. Citation Details Title: A greedy algorithm to determine the number of transporters in a cyclic electroplating process.(Scheduling & Logistics) Author: Ronald Armstrong Publication: IIE Transactions (Refereed) Date: May 1, 1996 Publisher: Institute of Industrial Engineers, Inc. (IIE) Volume: v28 Issue: n5 Page: p347(9) Distributed by Thomson Gale

Custom Search

CERTAIN CONTENT THAT APPEARS ON THIS SITE COMES FROM AMAZON SERVICES LLC. THIS CONTENT IS PROVIDED ‘AS IS’ AND IS SUBJECT TO CHANGE OR REMOVAL AT ANY TIME.