Pages that link to "Item:Q2297575"
From MaRDI portal
The following pages link to Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines (Q2297575):
Displaying 11 items.
- Ant colony-based algorithms for scheduling parallel batch processors with incompatible job families (Q964482) (← links)
- An ant colony optimization algorithm for load balancing in parallel machines with sequence-dependent setup times (Q1762101) (← links)
- Graph based twin cost matrices for unbalanced assignment problem with improved ant colony algorithm (Q2063304) (← links)
- A survey of job shop scheduling problem: the types and models (Q2146994) (← links)
- Parallel batch processing machines scheduling in cloud manufacturing for minimizing total service completion time (Q2676295) (← links)
- Multi-objective ACO algorithms to minimise the makespan and the total rejection cost on BPMs with arbitrary job weights (Q4600100) (← links)
- Integrated scheduling on parallel batch processing machines with non-identical capacities (Q5059346) (← links)
- A bi-objective synergy optimization algorithm of ant colony for scheduling on non-identical parallel batch machines (Q5142659) (← links)
- An improved ant colony algorithm for solving batch scheduling problems with non-identical job sizes (Q5257191) (← links)
- A fast ant-colony algorithm for single-machine scheduling to minimize the sum of weighted tardiness of jobs (Q5313400) (← links)
- Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization (Q6167854) (← links)
