𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimizing a weighted quadratic function of job lateness in the single machine system

✍ Scribed by Tapan Sen; Parthasarati Dileepan; Mary R. Lind

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
528 KB
Volume
42
Category
Article
ISSN
0925-5273

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Single machine scheduling to minimize th
Single machine scheduling to minimize the number of late jobs under uncertainty
✍ Shao Chin Sung; Milan Vlach πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 227 KB

In this paper, we deal with the problem of sequencing a ΓΏnite number of jobs for processing by a single machine with the objective of minimizing the number of jobs that are not completed by their due dates. We propose a rather general model based on an algebraic approach. By specifying suitable bina

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