The two-machine flowshop total completion time problem:...

European Journal of Operational Research 2016 / 08 Vol. 252; Iss. 3

The two-machine flowshop total completion time problem: Branch-and-bound algorithms based on network-flow formulation

Detienne, Boris, Sadykov, Ruslan, Tanaka, Shunji
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:
252
Language:
english
Journal:
European Journal of Operational Research
DOI:
10.1016/j.ejor.2016.02.003
Date:
August, 2016
File:
PDF, 565 KB
english, 2016
Conversion to is in progress
Conversion to is failed