Cite
HARVARD Citation
Takano, M. et al. (2017). A branch-and-bound method to minimize the makespan in a permutation flow shop with blocking and setup times. Cogent engineering. 4 (1), p. . [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Takano, M. et al. (2017). A branch-and-bound method to minimize the makespan in a permutation flow shop with blocking and setup times. Cogent engineering. 4 (1), p. . [Online].