A branch-and-bound method to minimize the makespan in a...

  • Main
  • 2017 / 10
  • A branch-and-bound method to minimize the makespan in a...
Cogent Engineering 2017 / 10

A branch-and-bound method to minimize the makespan in a permutation flow shop with blocking and setup times

Iwama Takano, Mauricio, Seido Nagano, Marcelo, Wenjun, Xu
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?
Language:
english
Journal:
Cogent Engineering
DOI:
10.1080/23311916.2017.1389638
Date:
October, 2017
File:
PDF, 396 KB
english, 2017
Conversion to is in progress
Conversion to is failed