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

Thek-Track Assignment Problem on Partial Orders

โœ Scribed by Paulo Barcia; J. Orestes Cerdeira

Publisher
Springer US
Year
2005
Tongue
English
Weight
222 KB
Volume
8
Category
Article
ISSN
1094-6136

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

Partial eigenvalue assignment problem of
Partial eigenvalue assignment problem of high order control systems using orthogonality relations
โœ Mohamed A. Ramadan; Ehab A. El-Sayed ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 619 KB

In this paper, we present an explicit solution to the partial eigenvalue assignment problem of high order control system using orthogonality relations between eigenvectors of the matrix polynomial. Our solution can be implemented with only a partial knowledge of the spectrum and the corresponding le