 Ant colony-based algorithms for scheduling parallel batch processors with incompatible job familiesM. Venkataramana and N.R. Srinivasa Raghavan International Journal of Mathematics in Operational Research, 2010, vol. 2, issue 1, 73-98 Abstract: In current dynamic business environments, meeting the customer due dates and avoiding delay penalties are very important. Our work concerns with the static scheduling of jobs to parallel identical batch processors for minimising the total weighted tardiness. It is assumed that the jobs are incompatible in respect of job families indicating that jobs from different families cannot be processed together. In practice, the problem cannot be solved using any classical OR algorithms in polynomial time due to the problem complexity. We develop metaheuristics, namely, the ant colony optimisation (ACO) approach to solve the problem efficiently. We propose three ant colony-based algorithms by using the structural properties of the problem. An extensive experimentation is conducted to evaluate the performance of the proposed algorithms on different problem sizes with the varied tardiness factors. Our experimentation shows that ACO-based algorithms perform better as compared to the available best dispatching rules and algorithms. Keywords: batch processors; scheduling; TWT; total weighted tardiness; heuristics; ACO; ant colony optimisation; batch processing. (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:2:y:2010:i:1:p:73-98 Access Statistics for this article More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.