A strategy for evolution of algorithms to increase the computational effectiveness of NP-hard scheduling problems

DOI10.1016/0377-2217(94)00196-0zbMath0913.90174OpenAlexW1990905155MaRDI QIDQ1266611

Kuan-Yueh Torng, Han-Kun Lin, Der-Chiang Li

Publication date: 7 October 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)00196-0

zbMATH Keywords

efficiencyeffectivenessinductive learning

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items

Using mega-fuzzification and data trend estimation in small data set learning for early FMS scheduling knowledge

Cites Work

• Dynamic programming and decomposition approaches for the single machine total tardiness problem
• A survey of algorithms for the single machine total weighted tardiness scheduling problem
• Unnamed Item
• Unnamed Item
• Unnamed Item