Ara
Toplam kayıt 1, listelenen: 1-1
A note on minimizing maximum lateness in an m-machine scheduling problem with a learning effect
(Elsevier Science Inc, 2009)
Conventionally, job processing times are assumed to be constant from the first job to be processed until the last job to be completed. However, recent empirical studies in several industries have verified that unit costs ...