Experimental-based simulated annealing for job shop scheduling problems with stochastic processing times
Job shop scheduling problem is widely known as one of the most difficult NP-Hard problems to solve and present efforts to solve the problems are mostly expressed in the form of heuristics. This thesis investigates the application of simulated annealing algorithm for solving job shop scheduling probl...
Disimpan dalam:
| Pengarang Utama: | |
|---|---|
| Format: | Thesis |
| Bahasa: | English |
| Diterbitkan: |
2013
|
| Subjek-subjek: | |
| Capaian Atas Talian: | http://eprints.utm.my/38873/ http://eprints.utm.my/38873/5/RashidahAhmadPFS2013.pdf |
| Penanda-penanda: |
Tambah Penanda
Tiada Penanda, Jadilah orang pertama menanda rekod ini!
|