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

Minimizing the number of tardy jobs with

โœ Scribed by Dan Trietsch; Kenneth R. Baker

Publisher
Springer US
Year
2007
Tongue
English
Weight
190 KB
Volume
11
Category
Article
ISSN
1094-6136

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Minimizing the number of tardy jobs with
Minimizing the number of tardy jobs with precedence constraints and agreeable due dates
โœ George Steiner ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 713 KB

## Minimizing the number of precedence constrained, unit-time tardy jobs is strongly NP-hard on a single machine. We study a special case of the problem where a job is tardy if it is finished more than a fixed K time units after its earliest possible completion time under the precedence constraint

Scheduling with two job classes and setu
Scheduling with two job classes and setup times to minimize the number of tardy jobs
โœ Jatinder N.D. Gupta; Johnny C. Ho ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 969 KB

This paper considers the problem of minimizing the number of tardy jobs to be processed on a single machine with two job classes where a job's setup time depends on its job class. This is an increasinbly important problem due to the growing popularity of group technology manufacturing techniques, wh