๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The payment scheduling problem

โœ Scribed by Richard C. Grinold


Publisher
John Wiley and Sons
Year
1972
Tongue
English
Weight
548 KB
Volume
19
Category
Article
ISSN
0894-069X

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

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

The poset scheduling problem
โœ Gerard J. Chang; Jack Edmonds ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› Springer Netherlands ๐ŸŒ English โš– 303 KB
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
The mixed shop scheduling problem
โœ Teruo Masuda; Hiroaki Ishii; Toshio Nishida ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 540 KB