Ant colony-based algorithms for scheduling parallel batch processors with incompatible job families
DOI10.1504/IJMOR.2010.029691zbMATH Open1184.90065OpenAlexW2035094564MaRDI QIDQ964482FDOQ964482
Authors: M. Venkataramana, N. R. Srinivasa Raghavan 
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
Recommendations
- scientific article; zbMATH DE number 5952318
- Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework
- Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines
- scientific article; zbMATH DE number 1783881
- An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups
heuristicsschedulingtotal weighted tardinessant colony optimisationACObatch processingbatch processorsTWT
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cited In (6)
- 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
- Title not available (Why is that?)
- Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines
- Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q964482)
