A NEW APPROACH TO JOB SHOP-SCHEDULING PROBLEM
In this paper, single-processors job shop scheduling problems are solved by a heuristic algorithm based on the hybrid of priority dispatching rules according to an ant colony optimization algorithm. The objective function is to minimize the makespan i.e. total completion time , in which a simultanou...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Center for Quality, Faculty of Engineering, University of Kragujevac, Serbia
2007-03-01
|
| Series: | International Journal for Quality Research |
| Subjects: | |
| Online Access: | http://www.ijqr.net/journal/v1-n1/9.pdf |