AI SearchApplication of genetic algorithm in continuous flow shop scheduling
Call Number: AIT Thesis no.ISE-05-05 Material type:
SeriesSeries: Asian Institute of Technology. Thesis ; no. ISE-05-05Publication details: Pathum Thani, Thailand : Asian Institute of Technology, 2005Description: 60 pSubject(s): Online resources: Dissertation note: Thesis (M.Eng.) - Asian Institute of Technology, 2005 Summary: Continuous flow-shop scheduling problem is a class of sequencing problem in the field of production planning. The problem considered in this study is to find the permutation of jobs to be processed. The processing has no-waiting time between two consecutive jobs with respect to the objective of minimizing the makespan. The problem here is also NP-hard. This study considers the application of genetic algorithm to the continuous flow shop scheduling problem. Computational results is considered about the quality based on the running time and some parameters of the genetic algorithms, and the comparision with other two methods such as optimal method (Lingo) and cheapest insertion heuristic.
| 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.ISE-05-05 (Browse shelf(Opens below)) | 1 | Available | 30050120807549 | |||||||||||||
|
20-AIT Publication
|
Asian Institute of Technology Library AIT Publications | AIT Thesis no.ISE-05-05 (Browse shelf(Opens below)) | 2 | Available | 30050120807556 | |||||||||||||
40-Archives
|
Asian Institute of Technology Library Archives | AIT Thesis no.ISE-05-05 (Browse shelf(Opens below)) | 1 | Available | 30050160017629 |
A thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Advanced of Technologies
Thesis (M.Eng.) - Asian Institute of Technology, 2005
Continuous flow-shop scheduling problem is a class of sequencing problem in the field of production planning. The problem considered in this study is to find the permutation of jobs to be processed. The processing has no-waiting time between two consecutive jobs with respect to the objective of minimizing the makespan. The problem here is also NP-hard. This study considers the application of genetic algorithm to the continuous flow shop scheduling problem. Computational results is considered about the quality based on the running time and some parameters of the genetic algorithms, and the comparision with other two methods such as optimal method (Lingo) and cheapest insertion heuristic.
There are no comments on this title.