Heuristic driven genetic algorithm for job-shop scheduling
In this project, a local search algorithm has been implemented on a job-shop scheduling program[l] given at the initial stage of the project. The program was tested on 35 JSS benchmarks. The results show a range of performance that is 10% to 15% from the known optimum. Besides proposing and implemen...
Saved in:
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Theses and Dissertations |
| 語言: | English |
| 出版: |
2011
|
| 主題: | |
| 在線閱讀: | http://hdl.handle.net/10356/42789 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Nanyang Technological University |
| 語言: | English |
| 總結: | In this project, a local search algorithm has been implemented on a job-shop scheduling program[l] given at the initial stage of the project. The program was tested on 35 JSS benchmarks. The results show a range of performance that is 10% to 15% from the known optimum. Besides proposing and implementing the local search algorithm, the original JSS program is also ported to run on Win32 platforms(Win95 and NT). Its memory handling functions are modified to dynamically handle job-shop problems of any sizes from 5x5 up to 30x30. A Windows based graphical user interface(GUI) is written so that the user is able to modify benchmark specific parameters on the GUI and run several benchmarks in batch mode. |
|---|