A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Jobs Scheduling And Worker Assignment Problem To Minimize Makespan Using Ant Colony Optimization Metaheuristic
2012
Zenodo
This article proposes an Ant Colony Optimization (ACO) metaheuristic to minimize total makespan for scheduling a set of jobs and assign workers for uniformly related parallel machines. An algorithm based on ACO has been developed and coded on a computer program Matlab®, to solve this problem. The paper explains various steps to apply Ant Colony approach to the problem of minimizing makespan for the worker assignment & jobs scheduling problem in a parallel machine model and is aimed at
doi:10.5281/zenodo.1058336
fatcat:j4m6wa7hlzc4pid6kunjxz6nge