東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

A study on cyclic hoist scheduling p...

Jiang, Yun.

Linked to FindBook

Google Book

Amazon

博客來

A study on cyclic hoist scheduling problems.

Record Type:	Electronic resources : Monograph/item
Title/Author:	A study on cyclic hoist scheduling problems./
Author:	Jiang, Yun.
Description:	138 p.
Notes:	Source: Dissertation Abstracts International, Volume: 64-07, Section: B, page: 3506.
Contained By:	Dissertation Abstracts International64-07B.
Subject:	Operations Research. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3099561

A study on cyclic hoist scheduling problems.
Jiang, Yun.

A study on cyclic hoist scheduling problems. - 138 p.

Source: Dissertation Abstracts International, Volume: 64-07, Section: B, page: 3506.

Thesis (Ph.D.)--Hong Kong University of Science and Technology (People's Republic of China), 2003.

This thesis studies cyclic hoist scheduling problems in electroplating lines. Electroplating is a necessary process in producing printed circuit boards (PCBs). A number of computer controlled hoists mounted on a common track are responsible for transferring PCBs between processing tanks in an electroplating line. Scheduling the movement of these hoists is generally known as the Hoist Scheduling Problem (HSP). This thesis addresses a number of HSPs in cyclic production to minimize the cycle length.Subjects--Topical Terms:

626629
Operations Research.

A study on cyclic hoist scheduling problems.
LDR:03515nmm 2200337 4500 001 1852951
005 20040615083622.5
008 130614s2003 eng d
035 $a (UnM)AAI3099561
035 $a AAI3099561
040 $a UnM $c UnM
100 1 $a Jiang, Yun. $3 1940832
245 1 0 $a A study on cyclic hoist scheduling problems.
300 $a 138 p.
500 $a Source: Dissertation Abstracts International, Volume: 64-07, Section: B, page: 3506.
500 $a Adviser: Jiyin Liu.
502 $a Thesis (Ph.D.)--Hong Kong University of Science and Technology (People's Republic of China), 2003.
520 $a This thesis studies cyclic hoist scheduling problems in electroplating lines. Electroplating is a necessary process in producing printed circuit boards (PCBs). A number of computer controlled hoists mounted on a common track are responsible for transferring PCBs between processing tanks in an electroplating line. Scheduling the movement of these hoists is generally known as the Hoist Scheduling Problem (HSP). This thesis addresses a number of HSPs in cyclic production to minimize the cycle length.
520 $a We first study the single-hoist problem with processing time windows and two extended features. The first extension is that each PCB can visit a processing tank more than once. The second is that more than one identical tank may be used for one processing stage. These extensions are common in practical electroplating lines and can increase the processing capacities of lines. We formulate the problem with all these features as a mixed integer programming model. Numerical examples show that the model can be solved to optimum within reasonable time.
520 $a We then study multi-hoist problems. Problems with multiple hoists involve additional difficulties. One difficulty comes from the new decisions on assigning hoists to tasks. The other comes from the restriction on the relative positions of the hoists to avoid collision between them. We study the no-wait version of the problems in which the processing time and part transfer times are all fixed constants. For the two-hoist problem, we develop a polynomial algorithm to solve it based on comprehensive analysis of the non-collision requirements.
520 $a For the no-wait multi-hoist scheduling problem with any number of hoists, we identify a group of assignment constraints for any given cycle length. The feasibility of the cycle length is determined by solving this group of constraints. A polynomial algorithm is then developed to search for the optimal cycle length and to construct an optimal schedule.
520 $a The last problem discussed in the thesis is the multi-hoist problem with processing time windows. The introduction of time windows makes the problem NP-complete. We transform the non-collision requirements to some compact mathematical constraints and develop a mixed integer programming model for this problem. A numerical example shows that the model is solvable for problems with small size.
520 $a Finally, we briefly discuss the extension of this study to other scheduling problems for further research. Two similar problems in container terminals with non-collision requirements are described.
590 $a School code: 1223.
650 4 $a Operations Research. $3 626629
650 4 $a Engineering, Industrial. $3 626639
650 4 $a Engineering, System Science. $3 1018128
690 $a 0796
690 $a 0546
690 $a 0790
710 2 0 $a Hong Kong University of Science and Technology (People's Republic of China). $3 1249812
773 0 $t Dissertation Abstracts International $g 64-07B.
790 1 0 $a Liu, Jiyin, $e advisor
790 $a 1223
791 $a Ph.D.
792 $a 2003
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3099561