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

Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times

โœ Scribed by Gur Mosheiov, Dvir Shabtay

Book ID
120729815
Publisher
Springer US
Year
2013
Tongue
English
Weight
275 KB
Volume
16
Category
Article
ISSN
1094-6136

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Maximizing the weighted number of on-tim
Maximizing the weighted number of on-time jobs in single machine scheduling with time windows
โœ C. Koulamas ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 541 KB

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.

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