Disjunctive programming as initial solution for tabu search in solving job shop scheduling problem
Also available in printed version
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Master's thesis |
| Language: | English |
| Published: |
Universiti Teknologi Malaysia
2025
|
| Subjects: | |
| Online Access: | https://utmik.utm.my/handle/123456789/51172 |
| Abstract | Abstract here |
| _version_ | 1854975113572646912 |
|---|---|
| author | Wong, Kiing Ling |
| author2 | Syarifah Zyurina Nordin, supervisor |
| author_facet | Syarifah Zyurina Nordin, supervisor Wong, Kiing Ling |
| author_sort | Wong, Kiing Ling |
| description | Also available in printed version |
| format | Master's thesis |
| id | utm-123456789-51172 |
| institution | Universiti Teknologi Malaysia |
| language | English |
| publishDate | 2025 |
| publisher | Universiti Teknologi Malaysia |
| record_format | dspace |
| record_pdf | Abstract |
| spelling | utm-123456789-511722025-08-21T12:56:22Z Disjunctive programming as initial solution for tabu search in solving job shop scheduling problem Wong, Kiing Ling Syarifah Zyurina Nordin, supervisor Science Also available in printed version Scheduling, in short, is the allocation of various resources with the aim to arrange and control to find an optimization in the work process. Appearance of job shop scheduling problem brings a big impact to the manufacturing sector since this type of scheduling problem affects the production process and profit of the industry. To improve the efficiency of the manufacturing process as well as minimizing the cost, it is vital to apply job shop scheduling problem in this sector. One of the metaheuristic methods, tabu search has been selected to solve the job shop scheduling problem. The initial solution is gained by Giffler and Thompson (GT) algorithm with shortest processing time (SPT), longest processing time (LPT) and Random rules using C++ programming language and disjunctive programming (DP) with shortest total processing time (STPT) and longest total processing time (LTPT) rules using LINDO software. Meanwhile, the type of neighborhood structure used in tabu search is neighbourhood structure 1 (N1). In this study, the effectiveness of the proposed disjunctive programming as initial solution for tabu search will be investigated. In addition, the effect of different tabu list length on the tested problem instances will also be examined and the results are then compared with the benchmark values from previous researchers to test the performance quality. In conclusion, both GT algorithm and DP as the initial solution for tabu search manage to produce an overall good result in job shop scheduling. Future research is suggested to test DP with more problem instances of size 10 x 10 and other sizes which are not use in this study zulaihi UTM 159 p. Thesis (Sarjana Sains) - Universiti Teknologi Malaysia, 2018 2025-03-14T04:05:15Z 2025-03-14T04:05:15Z 2018 Master's thesis https://utmik.utm.my/handle/123456789/51172 vital:115315 valet-20181009-083047 ENG Closed Access UTM Complete Unpublished Completion application/pdf Universiti Teknologi Malaysia |
| spellingShingle | Science Wong, Kiing Ling Disjunctive programming as initial solution for tabu search in solving job shop scheduling problem |
| thesis_level | Master |
| title | Disjunctive programming as initial solution for tabu search in solving job shop scheduling problem |
| title_full | Disjunctive programming as initial solution for tabu search in solving job shop scheduling problem |
| title_fullStr | Disjunctive programming as initial solution for tabu search in solving job shop scheduling problem |
| title_full_unstemmed | Disjunctive programming as initial solution for tabu search in solving job shop scheduling problem |
| title_short | Disjunctive programming as initial solution for tabu search in solving job shop scheduling problem |
| title_sort | disjunctive programming as initial solution for tabu search in solving job shop scheduling problem |
| topic | Science |
| url | https://utmik.utm.my/handle/123456789/51172 |
| work_keys_str_mv | AT wongkiingling disjunctiveprogrammingasinitialsolutionfortabusearchinsolvingjobshopschedulingproblem |