Improved algorithms for two single machine scheduling problems

Theoretical Computer Science

Volumn 363, Issue 3, 2006, Pages 257-265

  He, Yong ^a   Zhong, Weiya ^a   Gu, Huikun ^a  

^a ZHEJIANG UNIVERSITY   (China)

Author keywords

Delivery; Scheduling; Worst case ratio

Indexed keywords

APPROXIMATION ALGORITHM; SINGLE MACHINE SCHEDULING PROBLEMS; WORST-CASE RATIO;

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING;

SCHEDULING;

EID: 33749442005     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.04.014     Document Type: Article

References (8)

1. Adiri I., Bruno J., Frostig E., and Rinnooy Kan A.H.G. Single machine flow-time scheduling with a single breakdown. Acta Inform. 26 (1989) 679-696
2. Chang Y.C., and Lee C.Y. Machine scheduling with job delivery coordination. European J. Oper. Res. 158 (2004) 470-487
3. H. Kellerer, U. Pferschy, A New Fully Polynomial Approximation Scheme for the Knapsack Problem, Lecture Notes in Computer Science, Vol. 1444, 1998, 123-134.
4. Lawler E. Fast approximation algorithms for knapsack problems. Math. Oper. Res. 4 (1979) 339-356
5. Lee C.Y., and Liman S.D. Single machine flow-time scheduling with scheduled maintance. Acta Inform. 29 (1992) 375-382
6. Sadfi C., Penz B., Rapine C., Błazewicz J., and Formanowicz P. An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints. European J. Oper. Res. 161 (2005) 3-10
7. Simchi-Levi D., and 1994. New worst-case results for the bin packing problem. Naval Res. Logist. 41 (1994) 579-585
8. Yue M. A simple proof of the inequality FFD (L) ≤ frac(11, 9) OPT (L) + 1∀ L, for the FFD bin-packing algorithm. Acta Math. Appl. Sin. 7 (1991) 321-331