Using artificial bees to solve partitioning and scheduling problems in codesign

DOI10.1016/j.amc.2006.08.166zbMath1128.90027OpenAlexW2024619603MaRDI QIDQ884644

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

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

zbMATH Keywords

optimizationpartitioningschedulingcodesignMBO algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (5)

An investigation on a two-agent single-machine scheduling problem with unequal release dates ⋮ A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects ⋮ 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 ⋮ The single-machine total tardiness problem with unequal release times and a linear deterioration

Uses Software

• SynDEx

Cites Work

• Unnamed Item
• Unnamed Item
• Quadratic assignment problems
• Comparing three heuristic search methods for functional partitioning in hardware--software codesign

This page was built for publication: Using artificial bees to solve partitioning and scheduling problems in codesign