AI SearchA case study on nxm job shop scheduling problem using heuristic approach
Call Number: AIT Thesis no. 1154 Material type:
TextSeries: Asian Institute of Technology. Thesis ; no. 1154Publication details: Bangkok : Asian Institute of Technology, 1976Description: 77 pSubject(s): Online resources: Dissertation note: Thesis (M.Eng.) - Asian Institute of Technology, 1976 Summary: This study describes a heuristic algorithm for seeking a quick and near optimal solution to the n jobs m machines job shop scheduling problem in which each job 4as a number of operations to be performed on the specified machines in an ordering which are not the same for all jobs. The model can handle different machines required sequences including l oops, job precedence structure and start- stop lag. The objective is to minimize the total operation time. The developed heuristic algorithm is an extensions of the heuristic rules of the jobs two machines scheduling problem. At any instant during the n operation the m machines problem can be converted into a two machine problem. One of this is the machine under consideration and the other machine represents the rest of the machines required by the job through the first one. In this study, the model has been applied to solve a real-world problem. The results are observed to be sat is factory.
| Cover image | Item type | Current library | Home library | Collection | Shelving location | Call number | Materials specified | Vol info | URL | Copy number | Status | Notes | Date due | Barcode | Item holds | Item hold queue priority | Course reserves | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
20-AIT Publication
|
Asian Institute of Technology Library AIT Publications | AIT Thesis no. 1154 (Browse shelf(Opens below)) | 2 | Available | 30050003022844 | |||||||||||||
40-Archives
|
Asian Institute of Technology Library Archives | AIT Thesis no. 1154 (Browse shelf(Opens below)) | Available | 30050160087754 |
A thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering of the Asian Institute of Technology, Bangkok, Thailand
Thesis (M.Eng.) - Asian Institute of Technology, 1976
This study describes a heuristic algorithm for seeking a quick and near optimal solution to the n jobs m machines job shop scheduling problem in which each job 4as a number of operations to be performed on the specified machines in an ordering which are not the same for all jobs. The model can handle different machines required sequences including l oops, job precedence structure and start- stop lag. The objective is to minimize the total operation time. The developed heuristic algorithm is an extensions of the heuristic rules of the jobs two machines scheduling problem. At any instant during the n operation the m machines problem can be converted into a two machine problem. One of this is the machine under consideration and the other machine represents the rest of the machines required by the job through the first one. In this study, the model has been applied to solve a real-world problem. The results are observed to be sat is factory.
There are no comments on this title.