Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines
From MaRDI portal
Publication:2297575
DOI10.1016/J.COR.2020.104889zbMATH Open1458.90382OpenAlexW3000213420WikidataQ126335267 ScholiaQ126335267MaRDI QIDQ2297575FDOQ2297575
Authors: Han Zhang, Kai Li, Zhao-hong Jia 
Publication date: 20 February 2020
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2020.104889
Recommendations
- Integrated scheduling on parallel batch processing machines with non-identical capacities
- An improved ant colony algorithm for solving batch scheduling problems with non-identical job sizes
- Ant colony-based algorithms for scheduling parallel batch processors with incompatible job families
- Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework
- An algorithm of minimizing the total weighted completed time on batch processing machine
schedulingtotal weighted completion timeparallel batch machinesant colony optimization (ACO)arbitrary capacities
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Efficient scheduling algorithms for a single batch processing machine
- Minimizing makespan on a single burn-in oven in semiconductor manufacturing
- Makespan minimization on single batch-processing machine via ant colony optimization
- Minimizing makespan on a single batching machine with release times and non-identical job sizes
- Minimizing makespan on a single batch processing machine with nonidentical job sizes
- A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes
- Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes
- Scheduling a single batch processing machine with non-identical job sizes
- Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
- Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
- A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
- Minimizing total completion time on a batch processing machine with job families
- Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
- Heuristics, metaheuristics and approximate methods in planning and scheduling
- Scheduling a batch processing machine with non-identical job sizes
- Scheduling parallel machines with inclusive processing set restrictions
- The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan
- Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework
- Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities
- Analyzing evolutionary optimization and community detection algorithms using regression line dominance
- A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals
- A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes
Cited In (11)
- Parallel batch processing machines scheduling in cloud manufacturing for minimizing total service completion time
- Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization
- A fast ant-colony algorithm for single-machine scheduling to minimize the sum of weighted tardiness of jobs
- An ant colony optimization algorithm for load balancing in parallel machines with sequence-dependent setup times
- An improved ant colony algorithm for solving batch scheduling problems with non-identical job sizes
- A bi-objective synergy optimization algorithm of ant colony for scheduling on non-identical parallel batch machines
- Integrated scheduling on parallel batch processing machines with non-identical capacities
- Multi-objective ACO algorithms to minimise the makespan and the total rejection cost on BPMs with arbitrary job weights
- A survey of job shop scheduling problem: the types and models
- Ant colony-based algorithms for scheduling parallel batch processors with incompatible job families
- Graph based twin cost matrices for unbalanced assignment problem with improved ant colony algorithm
This page was built for publication: Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2297575)
