A note on: ‘A unified formulation of the machine scheduling problem’
✍ Scribed by A.H. Land; G. Laporte; P. Miliotis
- Publisher
- Elsevier Science
- Year
- 1978
- Tongue
- English
- Weight
- 58 KB
- Volume
- 2
- 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