'Explicit Learning: an Effort towards Human Scheduling Algorithms'

'Explicit Learning: an Effort towards Human Scheduling Algorithms'

Abstract Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approaches are problem-specific and research into the development of a general scheduling algorithm is still in its inf...

Full description

Bibliographic Details
Main Authors: Li, Jingpeng, Aickelin, Uwe
Format: Conference or Workshop Item
Language:English
Published: 2003
Online Access:https://eprints.nottingham.ac.uk/261/

Similar Items

Similar Items