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: | en |
| Published: |
Department of Mathematics, Faculty of Science
2004
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/8799/1/TanHuiWoon2004_ABranchandBoundandSimulated.pdf http://eprints.utm.my/8799/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1845472081444077568 |
|---|---|
| author | Tan, Hui Woon Salim, Sutinah |
| author_facet | Tan, Hui Woon Salim, Sutinah |
| author_sort | Tan, Hui Woon |
| building | UTM Library |
| collection | Institutional Repository |
| content_provider | Universiti Teknologi Malaysia |
| content_source | UTM Institutional Repository |
| continent | Asia |
| country | Malaysia |
| description | 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 scheduling problem is represented by a disjunctive graph, then the optimal schedule is obtained using the branch and bound algorithm while simulated annealing is a local search based algorithm which will slightly perturb the initial feasible solution to decrease the makespan.
|
| format | Article |
| id | my.utm.eprints-8799 |
| institution | Universiti Teknologi Malaysia |
| language | en |
| publishDate | 2004 |
| publisher | Department of Mathematics, Faculty of Science |
| record_format | eprints |
| spelling | my.utm.eprints-87992017-10-11T01:56:42Z http://eprints.utm.my/8799/ A branch and bound and simulated annealing approach for job shop scheduling Tan, Hui Woon Salim, Sutinah QA Mathematics 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 scheduling problem is represented by a disjunctive graph, then the optimal schedule is obtained using the branch and bound algorithm while simulated annealing is a local search based algorithm which will slightly perturb the initial feasible solution to decrease the makespan. Department of Mathematics, Faculty of Science 2004-06 Article PeerReviewed application/pdf en http://eprints.utm.my/8799/1/TanHuiWoon2004_ABranchandBoundandSimulated.pdf Tan, Hui Woon and Salim, Sutinah (2004) A branch and bound and simulated annealing approach for job shop scheduling. Matematika, 20 (1). pp. 1-17. ISSN 0127-8274 |
| spellingShingle | QA Mathematics Tan, Hui Woon Salim, Sutinah A branch and bound and simulated annealing approach for job shop scheduling |
| title | A branch and bound and simulated annealing approach for job shop scheduling |
| title_full | A branch and bound and simulated annealing approach for job shop scheduling |
| title_fullStr | A branch and bound and simulated annealing approach for job shop scheduling |
| title_full_unstemmed | A branch and bound and simulated annealing approach for job shop scheduling |
| title_short | A branch and bound and simulated annealing approach for job shop scheduling |
| title_sort | branch and bound and simulated annealing approach for job shop scheduling |
| topic | QA Mathematics |
| url | http://eprints.utm.my/8799/1/TanHuiWoon2004_ABranchandBoundandSimulated.pdf http://eprints.utm.my/8799/ |
| url_provider | http://eprints.utm.my/ |