Proceedings of the 2012 International Conference on Computer Application and System Modeling (ICCASM 2012)

The Improvement of The Total Flow-Time Problem under The Non-Idle Machine Constraint of Two Machine Open-Shop

Authors
Lin Liu, Weifeng Liu
Corresponding Author
Lin Liu
Available Online August 2012.
DOI
10.2991/iccasm.2012.103How to use a DOI?
Keywords
Total flow-time, Open-shop, Efficient algorithm, Scheduling
Abstract

The total flow-time problem of two machine open-shop is NP-hard in strong sense. For the above problem without constrains, an explicit solution is constructed in this paper from the optimal schedule under the non-idle machine constraint, its total flow-time is reductive. The explicit solution under non-idle machine constraints must not be the explicit solution without constraints is proved under the consideration.

Copyright
© 2012, the Authors. Published by Atlantis Press.
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

Volume Title
Proceedings of the 2012 International Conference on Computer Application and System Modeling (ICCASM 2012)
Series
Advances in Intelligent Systems Research
Publication Date
August 2012
ISBN
978-94-91216-00-8
ISSN
1951-6851
DOI
10.2991/iccasm.2012.103How to use a DOI?
Copyright
© 2012, the Authors. Published by Atlantis Press.
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Cite this article

TY  - CONF
AU  - Lin Liu
AU  - Weifeng Liu
PY  - 2012/08
DA  - 2012/08
TI  - The Improvement of The Total Flow-Time Problem under The Non-Idle Machine Constraint of Two Machine Open-Shop
BT  - Proceedings of the 2012 International Conference on Computer Application and System Modeling (ICCASM 2012)
PB  - Atlantis Press
SP  - 411
EP  - 414
SN  - 1951-6851
UR  - https://doi.org/10.2991/iccasm.2012.103
DO  - 10.2991/iccasm.2012.103
ID  - Liu2012/08
ER  -