✦ LIBER ✦

The poset scheduling problem

✍ Scribed by Gerard J. Chang; Jack Edmonds

Publisher: Springer Netherlands
Year: 1985
Tongue: English
Weight: 303 KB
Volume: 2
Category: Article
ISSN: 0167-8094
DOI: 10.1007/bf00334849

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The payment scheduling problem

✍ Richard C. Grinold 📂 Article 📅 1972 🏛 John Wiley and Sons 🌐 English ⚖ 548 KB

The payment scheduling problem

✍ Richard C. Grinold 📂 Article 📅 1972 🏛 John Wiley and Sons 🌐 English ⚖ 548 KB

Large complicated projects with interdependent activities can be described by project networks. Arcs represent activities, nodes represent events, and the network's structure defines the relation between activities and events. A schedule associates an occurrence time with each event: the project can

Greedy posets for the bump-minimizing pr

Greedy posets for the bump-minimizing problem

✍ Nejib Zaguia 📂 Article 📅 1987 🏛 Springer Netherlands 🌐 English ⚖ 678 KB

Two combinatorial problems on posets

✍ Yair Caro 📂 Article 📅 1996 🏛 Springer Netherlands 🌐 English ⚖ 367 KB

Bialostocki proposed the following problem: Let n 2 k 2 2 be integers such that k/n. Let p(n, k) denote the least positive integer having the property that for every poset P, IPI > p(n, k) and every &coloring f: P + & there exists either a chain or an antichain A, (Al = n and xaEA f(a) = 0 (modk). E

The Loading Time Scheduling Problem

✍ Randeep Bhatia; Samir Khuller; Joseph (Seffi) Naor 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 226 KB

In this paper we study precedence constrained scheduling problems, where the tasks can only be executed on a specified subset of the set of machines. Each machine has a loading time that is incurred only for the first task that is scheduled on the machine in a particular run. This basic scheduling p

The cyclic separation scheduling problem

✍ Ronald D. Armstrong; Prabhakant Sinha 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 594 KB