Bee colony optimization for scheduling independent tasks to identical processors

DOI10.1007/s10732-012-9197-3zbMath1358.90004OpenAlexW2061518278MaRDI QIDQ519106

Dušan Teodorović, Milica Šelmić, Dušan Ramljak, Tatjana Davidović

Publication date: 4 April 2017

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-012-9197-3

zbMATH Keywords

combinatorial optimizationscheduling problemsswarm intelligencebee colony optimization (BCO)homogeneous multiprocessor systems

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

A characterization of optimal multiprocessor schedules and new dominance rules ⋮ Minimizing the makespan on two identical parallel machines with mold constraints ⋮ Parallelization strategies for bee colony optimization based on message passing communication protocol

Uses Software

• CPLEX
• ABC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Honey-bee mating optimization (HBMO) algorithm for optimal reservoir operation
• Bee colony optimization for the \(p\)-center problem
• Design and evaluation of tabu search algorithms for multiprocessor scheduling
• An exact algorithm for the identical parallel machine scheduling problem.
• A standard task graph set for fair evaluation of multiprocessor scheduling algorithms
• A mathematical programming-based scheduling framework for multitasking environments
• Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems
• Tight bounds for the identical parallel machine scheduling problem
• An Application of Bin-Packing to Multiprocessor Scheduling
• Ant colony optimization and local search for bin packing and cutting stock problems
• Optimal Scheduling of Tasks on Identical Parallel Processors
• Bounds on Multiprocessing Timing Anomalies
• PERMUTATION-BASED GENETIC, TABU, AND VARIABLE NEIGHBORHOOD SEARCH HEURISTICS FOR MULTIPROCESSOR SCHEDULING WITH COMMUNICATION DELAYS