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

Maximizing the weighted number of on-time jobs in single machine scheduling with time windows

โœ Scribed by C. Koulamas

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
541 KB
Volume
25
Category
Article
ISSN
0895-7177

No coin nor oath required. For personal study only.

โœฆ Synopsis

The problem of maximizing the weighted number of on-time jobs on a single machine with time windows (STW) is shown to be strongly NP-hard. An efficient. heuristic is presented for STW. Computational experiments indicate that the performance of the heuristic is quite good.

๐Ÿ“œ SIMILAR VOLUMES

Scheduling jobs to improve weighted on-t
Scheduling jobs to improve weighted on-time performance of a single machine
๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Society of Manufacturing Engineers ๐ŸŒ English โš– 115 KB

## 2003-2004 abstract and ke cword index specifically identify M. parafortuitum among a mixed microbial community in MWE It is also shown that the M. parafortuitum labeling methods are insensitive to the synthetic, semi-synthetic, and soluble oil MWF chemistries investigated. In addition, the use

Polynomial time algorithms for minimizin
Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
โœ Philippe Baptiste ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Springer US ๐ŸŒ English โš– 102 KB ๐Ÿ‘ 2 views

We study the problem of minimizing the weighted number of late jobs to be scheduled on a single machine when processing times are equal. In this paper, we show that this problem, as well as its preemptive variant, are strongly polynomial. When preemption is not allowed ( 1"p H "p, r H " w H ; H ), t