Discovering Heuristic Strategy for Solving Scheduling Problems

Optimallysolving a scheduling problemis computationally intractable, hencevarieties of techniques and methodshave been explored to obtain sub-optimal solutions to such problems. In this paper we introduce a technique that effectively combinesappropriate heuristics so as to find a quality solution whenused with a hill climbingalgorithm. Wewill demonstrate the proposed approachby applying it to solve some single machine scheduling problems. We comparethe quality of the solutions with the ones obtained by using randomizedtechniques.

• Type: Conference
• Year: 1998
• Where: FLAIRS
• Authors: Rasiah Loganantharaj
• Keywords: Artificial Intelligence, Computationally Intractable, FLAIRS 1998, Machine Scheduling Problems, Scheduling Problemis