Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time

Harun Aydilek, Ali Allahverdi. Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time. Computers & Mathematics with Applications, 59(2):684-693, 2010. [doi]

@article{AydilekA10,
  title = {Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time},
  author = {Harun Aydilek and Ali Allahverdi},
  year = {2010},
  doi = {10.1016/j.camwa.2009.10.025},
  url = {http://dx.doi.org/10.1016/j.camwa.2009.10.025},
  researchr = {https://researchr.org/publication/AydilekA10},
  cites = {0},
  citedby = {0},
  journal = {Computers & Mathematics with Applications},
  volume = {59},
  number = {2},
  pages = {684-693},
}