A genetic algorithm for the talent scheduling problem

DOI10.1016/0305-0548(94)90021-3zbMath0812.90070OpenAlexW1973308356MaRDI QIDQ1342111

Suleyman Tufekci, Anna-Lena Nordström

Publication date: 11 January 1995

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(94)90021-3

zbMATH Keywords

NP-hardtalent schedulinghybrid genetic search algorithms

Mathematics Subject Classification ID

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

Related Items (5)

Talent hold cost minimization in film production ⋮ An enhanced branch-and-bound algorithm for the talent scheduling problem ⋮ Enhanced genetic operators for the resolution of discrete constrained optimization problems ⋮ Genetic algorithms in constrained optimization ⋮ A multiagent society for military transportation scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some simplified NP-complete graph problems
• Optimal scheduling in film production to minimize talent hold cost
• A method for finding minimal bottle-neck cells for grouping part-machine families†
• Crossing Theory and Hierarchy Mapping

This page was built for publication: A genetic algorithm for the talent scheduling problem