✦ LIBER ✦

Restarts can help in the on-line minimization of the maximum delivery time on a single machine

✍ Scribed by Marjan van den Akker; Han Hoogeveen; Nodari Vakhania

Publisher: Springer US
Year: 2000
Tongue: English
Weight: 86 KB
Volume: 3
Category: Article
ISSN: 1094-6136
DOI: 10.1002/1099-1425(200011/12)3:6<333::aid-jos53>3.0.co;2-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimizing the weighted sum of quadratic

Minimizing the weighted sum of quadratic completion times on a single machine

✍ Federico Della Croce; Wlodzimierz Szwarc; Roberto Tadei; Paolo Baracco; Raffaele 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 429 KB 👁 2 views

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