An algorithm for constructing single machine schedules based on ant colony approach

DOI10.1134/S1064230713060075zbMath1308.90071MaRDI QIDQ2017633

V. A. Kostenko, A. V. Plakunov

Publication date: 23 March 2015

Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Stochastic scheduling theory in operations research (90B36)

Related Items (7)

Studying the effectiveness of an aggregation procedure for virtual links in onboard switched networks design ⋮ Planning computations in a multiprocessor system with unfixed parameters ⋮ Algorithm for resource allocation in data centers with independent schedulers for different types of resources ⋮ Computation scheduling in multiprocessor systems with several types of additional resources and arbitrary processors ⋮ Optimal correction of execution intervals for multiprocessor scheduling with additional resource ⋮ Combinatorial optimization algorithms combining greedy strategies with a limited search procedure ⋮ Making schedules in multiprocessing systems with several additional resources

Cites Work

• Unnamed Item
• Ant algorithms: theory and applications
• An algorithm for scheduling exchanges over a bus with centralized control and an analysis of its efficiency
• Ant colony optimization and local search for bin packing and cutting stock problems

This page was built for publication: An algorithm for constructing single machine schedules based on ant colony approach