Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework
From MaRDI portal
(Redirected from Publication:3545663)
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
Cited in
(16)- A multi-objective differential evolution algorithm for parallel batch processing machine scheduling considering electricity consumption cost
- Scheduling batch processing machine using max-min ant system algorithm improved by a local search method
- Makespan minimization on single batch-processing machine via ant colony optimization
- An algorithm for constructing single machine schedules based on ant colony approach
- A survey of scheduling with parallel batch (p-batch) processing
- Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families
- Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines
- A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes
- Research on batch scheduling problems with job release time based on a max-min ant system
- scientific article; zbMATH DE number 5952318 (Why is no real title available?)
- An improved ant colony algorithm for solving batch scheduling problems with non-identical job sizes
- A Dynamical Ant Colony Optimization with Heuristics for Scheduling Jobs on a Single Machine with a Common Due Date
- A fast ant-colony algorithm for single-machine scheduling to minimize the sum of weighted tardiness of jobs
- A new class of lower bounds for scheduling a batch processing machine to minimize makespan
- Ant colony-based algorithms for scheduling parallel batch processors with incompatible job families
- A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival
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)
