Using artificial bees to solve partitioning and scheduling problems in codesign

DOI10.1016/J.AMC.2006.08.166zbMATH Open1128.90027OpenAlexW2024619603MaRDI QIDQ884644FDOQ884644

Authors: Mouloud Koudil, Karima Benatchba, Amina Tarabet, El Batoul Sahraoui 

Publication date: 6 June 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.08.166

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

zbMATH Keywords

optimizationschedulingpartitioningcodesignMBO algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Title not available (Why is that?)
• Comparing three heuristic search methods for functional partitioning in hardware--software codesign
• Quadratic assignment problems
• Title not available (Why is that?)

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

Uses Software

• SynDEx

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)