Vakhania N, Shchepin E. Concurrent operations can be parallized in scheduling multiprocessor job shop. Journal of Scheduling 2002; 5: 227–245

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.