Sequencing of unrelated parallel machines :|ba case study at coats Phong Phu Co., Ltd., Vietnam | |
| Author | Le Tien Thinh |
| Call Number | AIT Thesis no.ISE-03-17 |
| Subject(s) | Dyes and dyeing Sequential machine theory |
| Note | A thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Advanced Technologies |
| Publisher | Asian Institute of Technology |
| Series Statement | Thesis ; no. ISE-03-17 |
| Abstract | This study focuses on sequencing of dyeing machines, which are bottleneck machines in the production line of Coats Phong Phu Co., Ltd. The parallel machine sequencing problem with unrelated machine is studied where the objective is to minimize the process makespan. Following real situation, the characteristics of jobs, dyeing machines and dyeing process are found and analyzed. From these characteristics, we proposed color index of each job and setup times are determined based on the different between color indexes of two consecutive jobs. Beyond, we try to group jobs and dyeing machines based on weight factor. We developed the Mixed Integer Linear Programming (MILP) for this problem. But the running time for each problem is unreasonable. For this reason, we also developed a greedy heuristic for solving this problem. The program to handle this algorithm is written in C++. This program is shown that the greedy heuristic yields very good solution and short running times. |
| Year | 2003 |
| Corresponding Series Added Entry | Asian Institute of Technology. Thesis ; no. ISE-03-17 |
| Type | Thesis |
| School | School of Advanced Technologies (SAT) |
| Department | Department of Industrial Systems Engineering (DISE) |
| Academic Program/FoS | Industrial Systems Engineering (ISE) |
| Chairperson(s) | Huynh Trnng Luong; |
| Examination Committee(s) | Anulark Techanitisawad;Voratas Kachitvichyanukul; |
| Scholarship Donor(s) | Asian Institute of Technology (Partial Scholarship); |
| Degree | Thesis (M.Eng.) - Asian Institute of Technology, 2003 |