✦ LIBER ✦

An LPT-Bound for a Parallel Multiprocessor Scheduling Problem

✍ Scribed by F. Harche; S. Seshadri

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 476 KB
Volume: 196
Category: Article
ISSN: 0022-247X
DOI: 10.1006/jmaa.1995.1405

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scheduling of parallel processors: A pos

Scheduling of parallel processors: A posterior bound on LPT sequencing and a two-step algorithm

✍ James D. Blocher; Suresh Chand 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 565 KB

A Better Algorithm for an Ancient Schedu

A Better Algorithm for an Ancient Scheduling Problem

✍ David R. Karger; Steven J. Phillips; Eric Torng 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 280 KB

A new tabu search procedure for an audit

A new tabu search procedure for an audit-scheduling problem

✍ Peter Brucker; Doris Schumacher 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 141 KB 👁 1 views

We consider the following version of the auditing problem. A set of jobs must be processed by auditors A , . . . , A K . Each job consists of several tasks and there may be precedence constraints between these tasks. There is a due date associated with each job. Each auditor is available during disj

An FPTAS for a supply scheduling problem

An FPTAS for a supply scheduling problem with non-monotone cost functions

✍ Chi To Ng; Mikhail Yakovlevich Kovalyov; Tai Chiu Edwin Cheng 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 95 KB