Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization

DOI10.1016/j.ejor.2023.02.015OpenAlexW4321019883MaRDI QIDQ6167854

Chengbin Chu, Kai Li, Han Zhang, Zhao-hong Jia

Publication date: 10 July 2023

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2023.02.015

zbMATH Keywords

schedulingant colony optimizationtotal completion timeparallel batch machinesnon-identical capacities

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services
• A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes
• An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes
• Scheduling parallel-machine batch operations to maximize on-time delivery performance
• Minimizing makespan on a single burn-in oven in semiconductor manufacturing
• Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times
• Makespan minimization on single batch-processing machine via ant colony optimization
• A constraint programming approach for a batch processing problem with non-identical job sizes
• A survey of scheduling with parallel batch (p-batch) processing
• Exact algorithms to minimize makespan on single and parallel batch processing machines
• A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time
• 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
• Minimizing total completion time on a batch processing machine with job families
• Arc-flow approach for single batch-processing machine scheduling
• Parallel batch processing machines scheduling in cloud manufacturing for minimizing total service completion time
• Nature-Inspired Computation and Swarm Intelligence
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Minimizing makespan on a single batch processing machine with dynamic job arrivals
• Scheduling a single batch processing machine with non-identical job sizes
• Scheduling a batch processing machine with non-identical job sizes
• Scheduling

This page was built for publication: Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization