Ant colony-based algorithms for scheduling parallel batch processors with incompatible job families
From MaRDI portal
(Redirected from Publication:964482)
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
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
- scientific article; zbMATH DE number 5952318 (Why is no real title available?)
- 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)