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

A counterexample to the algorithms for determining opaque minimal forests

โœ Scribed by Thomas Shermer

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
117 KB
Volume
40
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A hybrid algorithm for the one machine s
A hybrid algorithm for the one machine sequencing problem to minimize total tardiness
โœ V. Srinivasan ๐Ÿ“‚ Article ๐Ÿ“… 1971 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 568 KB

In a recent paper, Hamilton Emmons has established theorems relating to the order in which pairs of jobs are to be processed in an optimal schedule to minimize the total tardiness of performing n jobs on one machine. Using these theorems, the algorithm of this paper determines the precedence relatio