Using artificial bees to solve partitioning and scheduling problems in codesign
From MaRDI portal
(Redirected from Publication:884644)
Recommendations
- Bee colony optimization for scheduling independent tasks to identical processors
- A heuristic-based bee colony algorithm for the multiprocessor scheduling problem
- Parallel approaches for the artificial bee colony algorithm
- A parallel algorithm for solving unfriendly beehive problems
- Bees algorithm for generalized assignment problem
Cites work
Cited in
(5)- A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times
- Bi-objective task assignment in heterogeneous distributed systems using honeybee mating optimization
- An investigation on a two-agent single-machine scheduling problem with unequal release dates
- The single-machine total tardiness problem with unequal release times and a linear deterioration
- A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects
This page was built for publication: Using artificial bees to solve partitioning and scheduling problems in codesign
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q884644)