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

The recognition problem with time constraints

โœ Scribed by P.P. Kol'tsov

Publisher
Elsevier Science
Year
1974
Weight
950 KB
Volume
14
Category
Article
ISSN
0041-5553

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Time-varying shortest path problems with
Time-varying shortest path problems with constraints
โœ Cai, X.; Kloks, T.; Wong, C. K. ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 159 KB

We study a new version of the shortest path problem. Let G ร… (V, E) be a directed graph. Each arc e โˆš E has two numbers attached to it: a transit time b(e, u) and a cost c(e, u), which are functions of the departure time u at the beginning vertex of the arc. Moreover, postponement of departure (i.e.

The -machine flowshop problem with unit-
The -machine flowshop problem with unit-time operations and intree precedence constraints
โœ Igor Averbakh; Oded Berman; Ilya Chernykh ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 163 KB

We consider the flowshop problem with unit-time operations and intree precedence constraints, with the objective to minimize the total completion time. We present a polynomial-time algorithm assuming that the number of machines is fixed. This proves a recently stated conjecture.