A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems
β Scribed by V. Sridharan; Z. Zhou
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 834 KB
- Volume
- 94
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In a recent paper by Valente ''Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time" ', Computers & Industrial Engineering, 55, 663-675, 2008, several beam search approaches are compared on a large set of instances of the total weighted earlinesstard
This paper analyzes the Smith-heuristic for the single-machine scheduling problem where the objective is to minimize the total weighted completion time subject to the constraint that the tardiness for any job does not exceed a prespecified maximum allowable tardiness. We identify several cases of th