Minimizing total completion time in a two-machine flow-shop scheduling problems with a single server
Abstract
We consider the problem of two-machine flow-shop scheduling with a single server and equal processing times, we show that this problem is NP-hard in the strong sense and present a busy schedule for it with worst-case bound.
Copyright © 2012 Shi Ling, Cheng Xue-guang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Cite this article
S. Ling, C. Xue-guang, Minimizing total completion time in a two-machine flow-shop scheduling problems with a single server, J. Math. Comput. Sci. 2 (2012), 435–440.
BibTeX
@article{Ling2012,
author = {Ling, Shi and Xue-guang, Cheng},
title = {Minimizing total completion time in a two-machine flow-shop scheduling problems with a single server},
journal = {J. Math. Comput. Sci.},
volume = {2},
year = {2012},
pages = {435--440},
doi = {}
}