Tabu search method for solving multiobjective job shop scheduling problem
Scheduling is widely studied and it involves of complex combinatorial optimization problems. A job shop scheduling problem (JSSP) is one of the common scheduling problems. The application of it ranges from manufacturing to services industries. It can be considered as a NP-hard problem. A lot of rese...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Thesis |
| 語言: | English |
| 出版: |
2015
|
| 主題: | |
| 在線閱讀: | http://eprints.utm.my/id/eprint/53981/25/NorFauzanaAwangMFS2015.pdf |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | Scheduling is widely studied and it involves of complex combinatorial optimization problems. A job shop scheduling problem (JSSP) is one of the common scheduling problems. The application of it ranges from manufacturing to services industries. It can be considered as a NP-hard problem. A lot of research has been performed in this particular area to obtain an effective schedule jobs for various objectives. More than one objective in a single problem is considered multiobjective problem. Two objectives, which are the maximum completion time (makespan) and total weighted tardiness, are measured simultaneously to improve the performance of the schedule. In this study, metaheuristic method known as tabu search algorithm is proposed to tackle the problem. But, first of all Giffler and Thompson (GT) algorithm will be applied to obtain the potential initial solution for the respective problem. Benchmark problem is used to evaluate and study the performance of the proposed algorithm. Results shows that tabu search provide a better solution compared to simulated annealing method. |
|---|