Analysis of parallel machines with splitting jobs and sequence-dependent set-up times /
In this research a particular scheduling problem present in semiconductor packaging manufacturing is defined and investigated. The problem consists in scheduling n independent non-preemptive jobs on m parallel machines. Each job j has a processing time and a deadline, the time at which the job must...
| Main Author: | |
|---|---|
| Format: | Thesis Book |
| Language: | English |
| Published: |
[Place of publication not identified] :
[publisher not identified] ;
2002.
|
| Subjects: | |
| Online Access: | http://proxy.library.tamu.edu/login?url=http://proquest.umi.com/pqdweb?did=765069551&sid=1&Fmt=2&clientId=2945&RQT=309&VName=PQD |
| Summary: | In this research a particular scheduling problem present in semiconductor packaging manufacturing is defined and investigated. The problem consists in scheduling n independent non-preemptive jobs on m parallel machines. Each job j has a processing time and a deadline, the time at which the job must be completed. These jobs consist of many identical parts that may be split into lots. For each lot, a constant set-up time is required before the first item of the lot is processed on each machine. A schedule stipulates the number of lots for each job, the lot size, the sequence of the lots on machines, and the starting and finishing time of each lot. The objective is to find a schedule that minimizes the total tardiness. The problem studied here is NP-hard; consequently, optimal solutions cannot be obtained even for problems of reasonable size. Hence a local search heuristic based on the simulated annealing (SA) algorithm was used. The computational work shows that using the SA algorithm can produce a nearly optimal solution to problems of practical size. Computational experiments were conducted on small, medium and large-sized problems. The data delivered by the SA algorithm includes a schedule that stipulates the number of lots for each job, the lot size, the sequence of the lots on the machines, and the starting and finishing time of each lot. |
|---|---|
| Item Description: | Vita. "Major Subject: Interdisciplinary Engineering". |
| Physical Description: | xi, 117 leaves : illustrations ; 28 cm. Issued also on microfiche from University Microfilm Inc. |
| Bibliography: | Includes bibliographical references (leaves 63-68). |