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...

Full description

Saved in:
Bibliographic Details
Main Author: Awang, Nor Fauzana
Format: Thesis
Language:English
Published: 2015
Subjects:
Online Access:http://eprints.utm.my/id/eprint/53981/25/NorFauzanaAwangMFS2015.pdf
http://eprints.utm.my/id/eprint/53981/
http://dms.library.utm.my:8080/vital/access/manager/Repository/vital:85830
Tags: Add Tag
No Tags, Be the first to tag this record!