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 |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|