Myopic heuristics for single machine scheduling problems
- 1 January 1981
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 19 (1) , 85-95
- https://doi.org/10.1080/00207548108956631
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.Keywords
This publication has 3 references indexed in Scilit:
- On Scheduling with Ready Times and Due Dates to Minimize Maximum LatenessOperations Research, 1975
- Sequencing with due‐dates and early start times to minimize maximum tardinessNaval Research Logistics Quarterly, 1974
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965