Solving a Class Scheduling Problem with a Genetic Algorithm

DOI10.1287/IJOC.7.4.443MaRDI QIDQ4869759zbMATH OpenOpenAlexFDO

Authors Jeffrey W. Herrmann, Chung-Yee Lee

Publication date 12 March 1996

Published in ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.7.4.443

zbMATH Keywords

genetic algorithmheuristicone-machine schedulingtotal flowtime

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35)

Recommendations

• A genetic algorithm for flow shop scheduling problems
• Genetic algorithms used to solve scheduling problems
• Scheduling in a sequence dependent setup environment with genetic search
• A genetic algorithm methodology for complex scheduling problems

Cited in

(8)

• Scheduling with batching: A review
• Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines
• Approximation algorithms for problems in scheduling with set-ups
• A genetic algorithm approach to school timetabling
• scientific article; zbMATH DE number 953073 (Why is no real title available?)
• scientific article; zbMATH DE number 1389747 (Why is no real title available?)
• An online algorithm for a problem in scheduling with set-ups and release times
• Efficient algorithms for machine scheduling problems with earliness and tardiness penalties

This page was built for publication: Solving a Class Scheduling Problem with a Genetic Algorithm

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