Citation
The two-machine flowshop total completion time problem: A branch-and-bound based on Network-flow formulation. In proceedings of the 7th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2015), 25 - 28 Aug 2015, Prague, Czech Republic, pages 635-637, 2015.
Abstract
Abstract
This paper is an extended abstract, so the entire paper is an abstract.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2015-635-637-A, author = {B. Detienne and R. Sadykov and S. Tanaka},
title = {The two-machine flowshop total completion time problem: A branch-and-bound based on Network-flow formulation},
booktitle = {In proceedings of the 7th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2015), 25 - 28 Aug 2015, Prague, Czech Republic},
year = {2015},
editor = {Z. Hanzalek and G. Kendall and B. McCollum and P. Sucha},
pages = {635--637},
note = {Abstract},
abstract = {This paper is an extended abstract, so the entire paper is an abstract.},
owner = {Graham},
timestamp = {2017.01.16},
webpdf = {2015-635-637-A.pdf} }