On solving permutation scheduling problems with ant colony optimization

DOI10.1080/00207720500062306MaRDI QIDQ5704628zbMATH OpenOpenAlexFDO

Authors Daniel Merkle, Martin Middendorf

Publication date 15 November 2005

Published in International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)

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

zbMATH Keywords

ant colony optimizationpermutation problemspheromone informationsingle machine schedulingsingle machine total tardiness problem

Mathematics Subject Classification ID

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) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A new approach to solve permutation scheduling problems with ant colony optimization
• Ant colony optimization with global pheromone evaluation for scheduling a single machine
• Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
• scientific article; zbMATH DE number 5584352
• Permutation flow shop scheduling algorithm based on ant colony optimization

Cites work

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

Cited in

(13)

• Ant colony optimization with global pheromone evaluation for scheduling a single machine
• Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
• An ant colony system for permutation flow-shop sequencing
• A new approach to solve permutation scheduling problems with ant colony optimization
• Differential evolution and differential ant-stigmergy on dynamic optimisation problems
• Permutation flow shop scheduling algorithm based on ant colony optimization
• A new ant colony optimization approach for the single machine total weighted tardiness scheduling problem
• Ant-based crossover for permutation problems
• Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes
• scientific article; zbMATH DE number 5584352 (Why is no real title available?)
• Environmentally constrained economic dispatch using Pareto archive particle swarm optimisation
• The recommender system for virtual items in MMORPGs based on a novel collaborative filtering approach
• An external partial permutations memory for ant colony optimization

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5704628)