On solving permutation scheduling problems with ant colony optimization

DOI10.1080/00207720500062306zbMath1103.90044OpenAlexW2046322637MaRDI QIDQ5704628

Martin Middendorf, Daniel Merkle

Publication date: 15 November 2005

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://ul.qucosa.de/api/qucosa%3A32051/attachment/ATT-0/

zbMATH Keywords

single machine schedulingant colony optimizationsingle machine total tardiness problempermutation problemspheromone information

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (4)

Environmentally constrained economic dispatch using Pareto archive particle swarm optimisation ⋮ Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes ⋮ The recommender system for virtual items in MMORPGs based on a novel collaborative filtering approach ⋮ Differential evolution and differential ant-stigmergy on dynamic optimisation problems

Cites Work

• Trade-off solutions in a single-machine scheduling problem for minimizing total earliness and maximum tardiness
• The Single Machine Early/Tardy Problem

This page was built for publication: On solving permutation scheduling problems with ant colony optimization