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

Job-shop scheduling with convex models of operations

โœ Scribed by A. Janiak; T. Szkodny

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
944 KB
Volume
20
Category
Article
ISSN
0895-7177

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Concurrent operations can be parallelize
Concurrent operations can be parallelized in scheduling multiprocessor job shop
โœ Nodari Vakhania; Evgeny Shchepin ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Springer US ๐ŸŒ English โš– 162 KB

We consider the multiprocessor job shop scheduling problem (JSP) with unrelated processors, an extension of the classical JSP. The precedence relations between the operations are given by an acyclic directed weighted graph, in which nodes represent operations and arcs represent precedence relations.