Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework

DOI10.1057/PALGRAVE.JORS.2602448zbMATH Open1176.90222OpenAlexW1975970216MaRDI QIDQ3545663FDOQ3545663

Author name not available (Why is that?)

Publication date: 11 December 2008

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602448

Recommendations

• Makespan minimization on single batch-processing machine via ant colony optimization
• An improved ant colony algorithm for solving batch scheduling problems with non-identical job sizes
• Scheduling batch processing machines with incompatible job families
• Ant colony-based algorithms for scheduling parallel batch processors with incompatible job families
• scientific article; zbMATH DE number 5952318

zbMATH Keywords

ant colony optimizationschedulingtotal weighted completion timebatch-processing machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (11)

• Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families
• A multi-objective differential evolution algorithm for parallel batch processing machine scheduling considering electricity consumption cost
• A fast ant-colony algorithm for single-machine scheduling to minimize the sum of weighted tardiness of jobs
• Title not available (Why is that?)
• A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes
• An algorithm for constructing single machine schedules based on ant colony approach
• A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival
• Makespan minimization on single batch-processing machine via ant colony optimization
• 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 Dynamical Ant Colony Optimization with Heuristics for Scheduling Jobs on a Single Machine with a Common Due Date

This page was built for publication: Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3545663)