The constrained minimum weighted sum of job completion times problem

Mathematical Programming

Volumn 108, Issue 1, 2006, Pages 115-126

  Levin, Asaf ^a   Woeginger, Gerhard J ^b,c  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b UNIVERSITY OF TWENTE   (Netherlands)

^c EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Approximation scheme; Combinatorial optimization; Scheduling

Indexed keywords

JOB ANALYSIS; LAGRANGE MULTIPLIERS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; RELAXATION PROCESSES; SCHEDULING;

CONSTRAINED MINIMUM WEIGHTED SUM; JOB COMPLETION TIMES PROBLEM; LAGRANGIAN RELAXATION; POLYNOMIAL TIME APPROXIMATION;

CONSTRAINT THEORY;

EID: 33646729103     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-005-0691-3     Document Type: Article

References (19)

1. Aslam, J.A., Rasala, A., Stein, C., Young, N.E.: Improved bicriteria existence theorems for scheduling. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA' 1999), 1999, pp. 846-847
2. Cole, R.: Slowing down sorting networks to obtain faster sorting algorithms. J. ACM 34, 200-208 (1987)
3. Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, San-Francisco, 1979
4. Goemans, M.X., Ravi, R.: The constrained minimum spanning tree problem. Proceedings of the 5th Scandinavian Workshop on Algorithm Theory (SWAT' 1996). LNCS 1097, Springer Verlag, 1996, pp. 66-75
5. Goemans, M., Williamson, D.P.: Two-dimensional Gantt charts and a scheduling algorithm of Lawler. SIAM J. Discrete Math. 13, 281-294 (2000)
6. Horn, W.A.: Single-machine job sequencing with tree-like precedence ordering and linear delay penalties. SIAM J. Appl. Math. 23, 189-202 (1972)
7. Hassin, R.: Approximation schemes for the restricted shortest path problem. Math. Oper. Res. 17, 36-42 (1992)
8. Levin, A.: A strongly polynomial-time approximation for a class of bicriteria problems. Oper. Res. Lett. 32, 530-534 (2004)
9. Lin, J.-H., Vitter, J.S.: ε-approximations with minimum packing violation. Proceedings of the 24th Annual ACM Symposium on the Theory of Computing (STOC'1992), 1992, pp. 771-782
10. Marathe, M.V., Ravi, R., Sundaram, R., Ravi, S.S., Rosenkrantz, D.J., Hunt H.B. III: Bicriteria network design problems. J. Algorithms 28, 142-171 (1998)
11. McCormick, S.T., Pinedo, M.L.: Scheduling n independent jobs on m uniform machines with both flow-time and makespan objectives: a parametric analysis. ORSA J. Comput. 7, 63-77 (1995)
12. Megiddo, N.: Combinatorial optimization with rational objective functions. Math. Oper. Res. 4, 414-424 (1979)
13. Queyranne, M.: Structure of a simple scheduling polyhedron. Math. Program. 58, 263-285 (1993)
14. Queyranne, M., Wang, Y.: Single-machine scheduling polyhedra with precedence constraints. Math. Oper. Res. 16, 1-20 (1991)
15. Rasala, A., Stein, C., Torng, E., Uthaisombut, P.: Existence theorems, lower bounds and algorithms for scheduling to meet two objectives. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'2002), 2002, pp. 723-731
16. Ravi, R.: Bicriteria spanning tree problems. Proceedings of the 5th Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX'2002). LNCS 2462, Springer Verlag, 2002, pp. 3-4
17. Shmoys, D.B., Tardos, E.: An approximation algorithm for the generalized assignment problem. Math. Program. 62, 461-474 (1993)
18. Smith, WE. : Various optimizers for single-stage production. Naval Research Logistics Quarterly 3, 59-66 (1956)
19. Stein, C., Wein, J.: On the existence of schedules that are near-optimal for both makespan and total-weighted completion time. Oper. Res. Lett. 21, 115-122 (1997)