Myopic heuristics for single machine scheduling problems

Abstract

For many years difficult combinatorial problems, such as scheduling problems, have been solved by the practitioner with heuristics. We suggest in this paper how to determine for which problems heuristics should be developed and, for a class of these problems, how to develop these procedures naturally. These results are motivated by theoretical results in computer science. The suggestion is numerically tested on a particular single machine scheduling problem.