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

Minimizing flow time on a constant number of machines with preemption

โœ Scribed by Nikhil Bansal

Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
180 KB
Volume
33
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

One-machine job-scheduling with non-cons
One-machine job-scheduling with non-constant capacity โ€” Minimizing weighted completion times
โœ H.F. Amaddeo; W.M. Nawijn; A. van Harten ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 720 KB

In this paper an n-job one-machine scheduling problem is considered, in which the machine capacity is time-dependent and jobs are characterized by their work content. The objective is to minimize the sum of weighted completion times. A necessary optimality condition is presented and we discuss some

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