Minimizing total flow time for the non-permutation flow...

Minimizing total flow time for the non-permutation flow shop scheduling problem with learning effects and availability constraints

Vahedi-Nouri, Behdin, Fattahi, Parviz, Ramezanian, Reza
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
32
Language:
english
Journal:
Journal of Manufacturing Systems
DOI:
10.1016/j.jmsy.2012.08.001
Date:
January, 2013
File:
PDF, 423 KB
english, 2013
Conversion to is in progress
Conversion to is failed