𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A greedy algorithm for scheduling tasks on production lines

✍ Scribed by S. Katsavounis

Publisher
Springer-Verlag
Year
2001
Tongue
English
Weight
545 KB
Volume
1
Category
Article
ISSN
1109-2858

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Greedy Algorithms for On-Line Data Compr
Greedy Algorithms for On-Line Data Compression
✍ JΓ³zsef BΓ©kΓ©si; GΓ‘bor Galambos; Ulrich Pferschy; Gerhard J Woeginger πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 191 KB

We consider on-line text-compression problems where compression is done by Ε½ . substituting substrings according to some fixed static dictionary code book . Due to the long running time of optimal algorithms, several heuristics have been introduced in the literature. In this paper, we continue the i

A Greedy On-Line Algorithm for thek-Trac
A Greedy On-Line Algorithm for thek-Track Assignment Problem
✍ U Faigle; W Kern; W.M Nawijn πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 107 KB

Given a collection I I of n jobs that are represented by intervals, we seek a maximal feasible assignment of the jobs to k machines such that not more than Ε½ . c M intervals overlap pairwise on any machine M and that a job is only assigned to a machine if it fits into one of several prescribed time

A scheduling algorithm for tasks describ
A scheduling algorithm for tasks described by Time Value Function
✍ Ken Chen; Paul Muhlethaler πŸ“‚ Article πŸ“… 1996 πŸ› Springer US 🌐 English βš– 964 KB

Some Real-Time systems may need a multivalence description of tasks. A generic way to achieve it consists in characterizing each task by a Time Value Function (TVF), which gives the contribution of the related task at its actual completion time. This approach can be viewed as a complementary paradig