Scheduling of Flow-Shop, Job-Shop, and Combined Scheduling Problems using MOEAs with Fixed and Variable Length Chromosomes

DOI10.1007/978-3-540-48584-1_3zbMath1200.90077OpenAlexW1591452858MaRDI QIDQ3053956

Gary B. Lamont, Mark P. Kleeman

Publication date: 5 November 2010

Published in: Evolutionary Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-48584-1_3

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items (1)

An effective heuristic algorithm for the partial shop scheduling problem

Uses Software

• Genocop
• SPEA2
• SHOP2

This page was built for publication: Scheduling of Flow-Shop, Job-Shop, and Combined Scheduling Problems using MOEAs with Fixed and Variable Length Chromosomes