Ant colony-based algorithms for scheduling parallel batch processors with incompatible job families
From MaRDI portal
Publication:964482
DOI10.1504/IJMOR.2010.029691zbMath1184.90065OpenAlexW2035094564MaRDI QIDQ964482
N. R. Srinivasa Raghavan, M. Venkataramana
Publication date: 15 April 2010
Published in: International Journal of Mathematics in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1504/ijmor.2010.029691
heuristicsschedulingtotal weighted tardinessant colony optimisationACObatch processingbatch processorsTWT
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (3)
Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times ⋮ A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes ⋮ A survey of scheduling with parallel batch (p-batch) processing
This page was built for publication: Ant colony-based algorithms for scheduling parallel batch processors with incompatible job families
