Article ID: | iaor20062618 |
Country: | United Kingdom |
Volume: | 56 |
Issue: | 8 |
Start Page Number: | 947 |
End Page Number: | 953 |
Publication Date: | Aug 2005 |
Journal: | Journal of the Operational Research Society |
Authors: | Rajendran C., Holthaus O. |
Keywords: | production |
The problem of scheduling on a single machine is considered in this paper with the objective of minimizing the sum of weighted tardiness of jobs. A new ant-colony optimization (ACO) algorithm, called fast ACO (FACO), is proposed and analysed for solving the single-machine scheduling problem. By considering the benchmark problems available in the literature for analysing the performance of algorithms for scheduling on a single machine with the consideration of weighted tardiness of jobs, we validate the appropriateness of the proposed local-search schemes and parameter settings used in the FACO. We also present a comparison of the requirements of CPU time for solving the single-machine total-weighted tardiness problem by the FACO and the existing algorithms.