Permutation flow shop scheduling algorithm based on ant colony optimization

DOI10.3724/SP.J.1087.2008.00302zbMATH Open1172.90406OpenAlexW2320297084MaRDI QIDQ3185503

Yanfeng Liu, Sanyang Liu

Publication date: 26 October 2009

Published in: Journal of Computer Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3724/sp.j.1087.2008.00302

zbMATH Keywords

ant colony optimizationpermutation flow shop schedulingNEH heuristics

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

An ant colony system for permutation flow-shop sequencing ⋮ Unnamed Item ⋮ Using artificial bee colony algorithm for permutation flow shop scheduling problem under makespan criterion

Recommendations

• An ant colony optimization approach to a permutational flowshop scheduling problem with outsourcing allowed 👍 👎
• An ant colony optimization algorithm for shop scheduling problems 👍 👎
• Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. 👍 👎
• An ant colony system for permutation flow-shop sequencing 👍 👎
• Using artificial bee colony algorithm for permutation flow shop scheduling problem under makespan criterion 👍 👎
• On solving permutation scheduling problems with ant colony optimization 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎

This page was built for publication: Permutation flow shop scheduling algorithm based on ant colony optimization

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