A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time

Discrete Applied Mathematics

Volumn 131, Issue 3, 2003, Pages 655-663

  Pisaruk, N N ^a  

^a UNIVERSITÉ DE LORRAINE   (France)

Author keywords

Approximation algorithm; Precedence relation; Scheduling; Single machine

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FLOW MEASUREMENT; GRAPH THEORY; PROBLEM SOLVING; THEOREM PROVING;

SINGLE MACHINES;

SCHEDULING;

EID: 0141963427     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(03)00334-2     Document Type: Article

References (9)

1. Ahju R., Magnanty T., Orlin J. Network Flows: Theory, Algorithms, and Applications. 1993;Prentice-Hall, New-York.
2. Chekuri C., Motwani R. Precedence constrained scheduling to minimize sum of weighted completion times on a single machine. Discrete Appl. Math. 98:1999;29-38.
3. Chudak F., Hochbaum D. A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine. Oper. Res. Lett. 25(5):1999;199-204.
4. Graham R.L., Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling. a survey Ann. Discrete Math. 5:1979;287-326.
5. Hall L.A., Shulz A.S., Shmoys D.B., Wein J. Scheduling to minimize average completion time. off-line and on-line approximation algorithms Math. Oper. Res. 22:1997;513-544.
6. Picard J.-C. Maximal closure of a graph and applications to combinatorial problems. Management Sci. 22:1976;1268-1272.
7. Picard J.-C., Queyranne M. On the structure of all minimum cuts in a network and applications. Math. Progr. Study. 13:1980;8-16.
8. Pisaruk N.N. The boundaries of submodular functions. J. Comput. Math. Math. Phys. 32:1992;1769-1783.
9. Tarjan R.E. Depth first search and linear graph algorithms. SIAM J. Comput. 1:1972;146-160.