Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines
From MaRDI portal
Publication:2297575
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
Cites work
- A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals
- A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
- A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes
- A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes
- Analyzing evolutionary optimization and community detection algorithms using regression line dominance
- Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities
- Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
- Efficient scheduling algorithms for a single batch processing machine
- Heuristics, metaheuristics and approximate methods in planning and scheduling
- Makespan minimization on single batch-processing machine via ant colony optimization
- Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes
- Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Minimizing makespan on a single batch processing machine with nonidentical job sizes
- Minimizing makespan on a single batching machine with release times and non-identical job sizes
- Minimizing makespan on a single burn-in oven in semiconductor manufacturing
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
- Minimizing total completion time on a batch processing machine with job families
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
- Scheduling a batch processing machine with non-identical job sizes
- Scheduling a single batch processing machine with non-identical job sizes
- Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework
- 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
Cited in
(11)- Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization
- Graph based twin cost matrices for unbalanced assignment problem with improved ant colony algorithm
- A bi-objective synergy optimization algorithm of ant colony for scheduling on non-identical parallel batch machines
- Parallel batch processing machines scheduling in cloud manufacturing for minimizing total service completion time
- An improved ant colony algorithm for solving batch scheduling problems with non-identical job sizes
- An ant colony optimization algorithm for load balancing in parallel machines with sequence-dependent setup times
- Ant colony-based algorithms for scheduling parallel batch processors with incompatible job families
- Multi-objective ACO algorithms to minimise the makespan and the total rejection cost on BPMs with arbitrary job weights
- A fast ant-colony algorithm for single-machine scheduling to minimize the sum of weighted tardiness of jobs
- Integrated scheduling on parallel batch processing machines with non-identical capacities
- A survey of job shop scheduling problem: the types and models
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)
