Optimally solving a scheduling problem is computationally intractable, hence varieties of techniques and methods have been explored to obtain sub-optimal solutions to such problems. In this paper we introduce a technique that effectively combines appropriate heuristics so as to find a quality solution when used with a hill climbing algorithm. We will demonstrate the proposed approach by applying it to solve some single machine scheduling problems. We compare the quality of the solutions with the ones obtained by using randomized techniques.
Published Date: May 1998
Registration: ISBN 978-1-57735-051-4
Copyright: Published by The AAAI Press, Menlo Park, California