An ant colony optimisation algorithm for scheduling in agile manufacturing

DOI10.1080/00207540600969782zbMath1153.90429OpenAlexW2159199591MaRDI QIDQ3533169

No author found.

Publication date: 23 October 2008

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540600969782

zbMATH Keywords

schedulingbranch-and-boundant colony optimisationagile manufacturing

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)

Related Items (3)

Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures ⋮ Variable neighbourhood search: methods and applications ⋮ Variable neighbourhood search: Methods and applications

Cites Work

• Variable neighborhood search for the degree-constrained minimum spanning tree problem
• A variable neighborhood search for graph coloring.
• An improved ant system algorithm for the vehicle routing problem
• An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
• Variable neighborhood search for the p-median
• A review of agile manufacturing systems
• Scheduling manufacturing systems for delayed product differentiation in agile manufacturing
• A fast ant-colony algorithm for single-machine scheduling to minimize the sum of weighted tardiness of jobs
• Genetic algorithms and simulated annealing for scheduling in agile manufacturing
• Handbook of metaheuristics

This page was built for publication: An ant colony optimisation algorithm for scheduling in agile manufacturing