A new approach to solve permutation scheduling problems with ant colony optimization

DOI10.1007/3-540-45365-2_50MaRDI QIDQ2771658zbMATH OpenFDO

Authors Daniel Merkle, Martin Middendorf

Publication date 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45365-2_50

zbMATH Keywords

ant colony optimization

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

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

Cited in

(7)

• An ant colony system for permutation flow-shop sequencing
• A multi-objective memetic algorithm for the job-shop scheduling problem
• Permutation flow shop scheduling algorithm based on ant colony optimization
• A Multiobjective Resource-Constrained Project-Scheduling Problem
• scientific article; zbMATH DE number 5584352 (Why is no real title available?)
• On solving permutation scheduling problems with ant colony optimization
• Evolutionary Computation in Combinatorial Optimization

This page was built for publication: A new approach to solve 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 Q2771658)