๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A note on generalizing the maximum lateness criterion for scheduling

โœ Scribed by Leslie A. Hall

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
625 KB
Volume
47
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A note on the complexity of family sched
A note on the complexity of family scheduling to minimize the number of late jobs
โœ T. C. Edwin Cheng; Zhaohui Liu; Yakov M. Shafransky ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Springer US ๐ŸŒ English โš– 65 KB ๐Ÿ‘ 2 views

The single-machine family scheduling problem of minimizing the number of late jobs has been known to be NP-hard, but whether it is NP-hard in the strong sense is cited as an open problem in several reviews. In this note, we prove that this problem is strongly NP-hard even if all set-up times and pro

A note on the single-machine scheduling
A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness
โœ Suresh Chand; Hans Schneeberger ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 328 KB

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