✦ LIBER ✦

On one scheduling problem

✍ Scribed by S. Yu. Sher

Publisher: Springer US
Year: 1989
Tongue: English
Weight: 379 KB
Volume: 46
Category: Article
ISSN: 1573-8795
DOI: 10.1007/bf01097149

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

One extremal problem in scheduling theor

One extremal problem in scheduling theory

✍ V. Ya. Burdyuk 📂 Article 📅 1975 🏛 Springer US 🌐 English ⚖ 549 KB

One machine scheduling problem with fuzz

One machine scheduling problem with fuzzy duedates

✍ Sangsu Han; Hiroaki Ishii; Susumu Fujii 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 542 KB

Method for solving one discrete-time sch

Method for solving one discrete-time scheduling problem

✍ Yu. P. Rudnev 📂 Article 📅 1984 🏛 Springer US 🌐 English ⚖ 502 KB

On an on-line scheduling problem for par

On an on-line scheduling problem for parallel jobs

✍ Edwin Naroska; Uwe Schwiegelshohn 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 101 KB

This paper addresses the non-preemptive on-line scheduling of parallel jobs. In particular we assume that the release dates and the processing times of the jobs are unknown. It is already known that for this problem Garey and Graham's list scheduling algorithm achieves the competitive factor 2 -1 m

One-machine generalized precedence const

One-machine generalized precedence constrained scheduling problems

✍ Erick D. Wikum; Donna C. Llewellyn; George L. Nemhauser 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 656 KB

A preemptive open shop scheduling proble

A preemptive open shop scheduling problem with one resource

✍ D. de Werra; J. Błażewicz; W. Kubiak 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 315 KB