Zobrazeno 1 - 1
of 1
pro vyhledávání: '"K. N. Kashyrskikh"'
Publikováno v:
Discrete Applied Mathematics. 114(1-3):255-271
The two-machine flow-shop sequencing problem with arbitrary release dates of jobs and the minimum makespan criterion is considered. The problem is known to be NP-hard, and the best-known approximation algorithms are those of Potts (Math. Oper. Res. 1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1159187feff44105c0d926a866aaac17
