Two-dimensional gantt charts and a scheduling algorithm of lawler

SIAM Journal on Discrete Mathematics

Volumn 13, Issue 3, 2000, Pages 281-294

  Goemans, Michel X ^a,b   Williamson, David P ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Linear programming; Scheduling; Series parallel

Indexed keywords

EID: 0041480788     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480197330254     Document Type: Article

References (14)

1. C. CHEKURI AND R. MOTWANI, Precedence Constrained Scheduling to Minimize Weighted Completion Time on a Single Machine, Technical Note STAN-CS-TN-97-58, Department of Computer Science, Stanford University, Stanford, CA, 1997.
2. W. L. EASTMAN, S. EVEN, AND I. M. ISAACS, Bounds for the optimal scheduling of n jobs on m processors, Management Sci., 11 (1964), pp. 268-279.
3. L. HALL AND F. CHUDAK, private communication, 1997.
4. E. L. LAWLER, Sequencing jobs to minimize total weighted completion time subject to precedence constraints, Ann. Discrete Math., 2 (1978), pp. 75-90.
5. E. L. LAWLER AND J. K. LENSTRA, Machine scheduling with precedence constraints, in Ordered Sets, I. Rival, ed., D. Reidel, Boston, MA, 1982, pp. 655-675
6. E. L. LAWLER, J. K. LENSTRA, A. H. G. RINNOOY KAN, AND D. B. SHMOYS, Sequencing and scheduling: Algorithms and complexity, in Logistics of Production and Inventory, S. Graves, A. Rinnooy Kan, and P. Zipkin, eds., Handbooks Oper. Res. Management Sci. 4, North Holland, Amsterdam 1993, pp. 445-522.
7. J. K. LENSTRA AND A. H. G. RINNOOY KAN, Complexity of scheduling under precedence constraints, Oper. Res., 26 (1978), pp. 22-35.
8. F. MARGOT, M. QUEYRANNE, AND Y. WANG, private communication, 1997.
9. C. L. MONMA, Properties and Efficient Algorithms for Certain Classes of Sequencing Problems, Ph.D. thesis, Cornell University, School of Operations Research and Industrial Engineering, Ithaca, NY, 1978.
10. C. L. MONMA ANC J. B. SIDNEY, Sequencing with series-parallel precedence constraints. Math. Oper. Res., 4 (1979), pp. 215-224.
11. M. QUEYRANNE AND Y. WANG, Single-machine scheduling polyhedra with precedence constraints, Math. Oper. Res., 16 (1991), pp. 1-20.
12. J. B. SIDNEY, Decomposition algorithms for single-machine sequencing with precedence relations and deferral costs, Oper. Res., 23 (1975), pp. 283-298.
13. W. E. SMITH, Various optimizers for single-stage production, Naval Res. Logist., 3 (1956), pp. 59-66.
14. A. VON ARNIM, U. FAIGLE, AND R. SCHRADER, The permutahedron of series-parallel posets, Discrete Appl. Math., 28 (1990), pp. 3-9.