Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Darshan Kalathia"'
Publikováno v:
Computers & Industrial Engineering. 121:139-149
This paper addresses the non-preemptive unrelated parallel machine scheduling problem (PMSP) with job sequence and machine dependent setup times. This is a widely seen NP-hard (non-deterministic polynomial-time) problem with the objective to minimize
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::111435656cfe12232ab88a99f48e51ac
https://doi.org/10.1016/j.cie.2018.05.014
https://doi.org/10.1016/j.cie.2018.05.014
