A branch and bound and simulated annealing approach for job shop scheduling
This paper presents two approaches to the solution of the job shop scheduling problem, namely the branch and bound, and simulated annealing approach. The objective is to schedule the jobs on the machines so that the total completion time is minimized. In the branch and bound approach, the job shop s...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Department of Mathematics, Faculty of Science
2004
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/8799/1/TanHuiWoon2004_ABranchandBoundandSimulated.pdf http://eprints.utm.my/id/eprint/8799/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|