Back to Search
Start Over
Semi-on-line scheduling problems for maximizing the minimum machine completion time.
- Source :
- Acta Mathematicae Applicatae Sinica; Jan2001, Vol. 17 Issue 1, p107-113, 7p
- Publication Year :
- 2001
-
Abstract
- This paper investigates several different semi-on-line two-machine scheduling problems for maximizing the minimum machine completion time. For each problem, we propose a best possible algorithm. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 01689673
- Volume :
- 17
- Issue :
- 1
- Database :
- Complementary Index
- Journal :
- Acta Mathematicae Applicatae Sinica
- Publication Type :
- Academic Journal
- Accession number :
- 50007095
- Full Text :
- https://doi.org/10.1007/BF02669690