Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Yurin N Sotskov"'
Publikováno v:
Journal of the Operational Research Society. 46:1481-1497
We consider a scheduling problem where a set of n jobs has to be processed on a set of m machines and arbitrary precedence constraints between operations are given. Moreover, for any two operations i and j values aij>0 and aji>0 may be given where ai
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::62a269f2499a768e815b5af65a7f447a
https://doi.org/10.1057/jors.1995.208
https://doi.org/10.1057/jors.1995.208
