Operations scheduling in job-shops /
"adding-on" the material handling activities. The
| Main Author: | |
|---|---|
| Format: | Thesis eBook |
| Language: | English |
| Published: |
[Place of publication not identified] :
[publisher not identified] ;
1996.
|
| Subjects: | |
| Online Access: | Link to OAKTrust copy |
| Summary: | "adding-on" the material handling activities. The (1) by solving the complete scheduling problem an automated or semi-automated job-shop system, where as a machine scheduling problem, neglecting the material by two approaches in the same solution computing time - computing time, or in producing a better solution in a directly, and (2) by solving the simplified machine experiments. It is concluded that the approach of for the complete problem. given time. In this thesis the complete operations handling tasks that effect transfer from one processing machine to another. This has helped in reducing the material handling appears to be better (on average) than parts with various routings contend for service on the relative performance of the two approaches is studied by resources in the system. The classical job-shop schedule for a job-shop scheduling problem is generated scheduling problem and using its solution to generate scheduling problem has usually been solved in literature size of the problem and in decreasing the solution solving the complete scheduling problem including solving the truncated problem and generating a solution testing a suitable hypothesis using results from various the solution to the complete scheduling problem by This thesis is in the area of operations scheduling in |
|---|---|
| Item Description: | "Major subject: Industrial Engineering". Vita. |
| Physical Description: | vii, 142 leaves : illustrations ; 28 cm. Also available online. Issued also on microfiche from Lange Micrographics. |
| Bibliography: | Includes bibliographical references: pages 69-72. |