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...
Disimpan dalam:
| Pengarang Utama: | |
|---|---|
| Format: | Thesis |
| Bahasa: | English |
| Diterbitkan: |
2015
|
| Subjek-subjek: | |
| Capaian Atas Talian: | http://eprints.utm.my/53981/ http://eprints.utm.my/53981/25/NorFauzanaAwangMFS2015.pdf |
| Penanda-penanda: |
Tambah Penanda
Tiada Penanda, Jadilah orang pertama menanda rekod ini!
|
Jadilah orang pertama meninggalkan komen!