Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework
From MaRDI portal
Publication:3545663
DOI10.1057/palgrave.jors.2602448zbMath1176.90222OpenAlexW1975970216MaRDI QIDQ3545663
No author found.
Publication date: 11 December 2008
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602448
Related Items (7)
A multi-objective differential evolution algorithm for parallel batch processing machine scheduling considering electricity consumption cost ⋮ Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families ⋮ Makespan minimization on single batch-processing machine via ant colony optimization ⋮ A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival ⋮ Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines ⋮ A survey of scheduling with parallel batch (p-batch) processing ⋮ A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes
This page was built for publication: Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework
