Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed. Sung; Sup, C.; Kim; and Hwan, Y. Computers & OR, 29(3):275-294, 2002.
Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed. [link]Link  Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed. [link]Paper  bibtex   
@article{ journals/cor/SungK02,
  added-at = {2006-02-20T00:00:00.000+0100},
  author = {Sung, Chang Sup and Kim, Young Hwan},
  biburl = {http://www.bibsonomy.org/bibtex/213960d7fa9b44a5f109e8dcb6fcce228/dblp},
  date = {2006-02-20},
  description = {dblp},
  ee = {http://dx.doi.org/10.1016/S0305-0548(00)00071-X},
  interhash = {ec4888815c75307c911d4c27989da858},
  intrahash = {13960d7fa9b44a5f109e8dcb6fcce228},
  journal = {Computers & OR},
  keywords = {dblp},
  number = {3},
  pages = {275-294},
  title = {Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed.},
  url = {http://dblp.uni-trier.de/db/journals/cor/cor29.html#SungK02},
  volume = {29},
  year = {2002}
}
Downloads: 0