Facets of the generalized permutahedron of a poset

Discrete Applied Mathematics

Volumn 72, Issue 1-2, 1997, Pages 179-192

  Von Arnim, Annelie ^b   Schulz, Andreas S ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b UNIVERSITY OF COLOGNE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041438087     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(96)00044-3     Document Type: Article

References (12)

1. A. von Arnim, U. Faigle and R. Schrader, The permutahedron of series-parallel posets, Discrete Applied Mathematics 28 (1990) 3-9.
2. A. von Armin, R. Schrader and Y. Wang, The permutahedron of N-sparse posets, Discrete Appl. Math., to appear.
3. E.L. Lawler, Sequencing jobs to minimize total weighted completion time subject to precedence constraints, Annals of Discrete Mathematics 2 (1978) 75-90.
4. J.K. Lenstra and A.H.G. Rinnooy Kan, Complexity of scheduling under precedence constraints, Operations Research 26 (1978) 22-35.
5. W.R. Pulleyblank, Polyhedral Combinatorics, in: G.L. Nemhauser, A.H.G. Rinnooy Kan, and M.J. Todd (eds.), Optimization, vol. 1 of Handbooks in Operations Research and Management Science, North-Holland, Amsterdam (1989) 371-446.
6. M. Queyranne, Structure of a simple scheduling polyhedron, Mathematical Programming 58 (1993) 263-285.
7. M. Queyranne and A.S. Schulz, Polyhedral approaches to machine scheduling, Preprint 408/1994, Department of Mathematics, Technical University of Berlin, Berlin, Germany.
8. M. Queyranne and Y. Wang, Single-machine scheduling polyhedra with precedence constraints, Mathematics of Operations Research 16 (1991) 1-20.
9. M. Queyranne and Y. Wang, A cutting plane procedure for precedence-constrained single machine scheduling, Preprint, Faculty of Commerce, University of British Columbia, Vancouver, Canada, 1991.
10. A.S. Schulz, Polyedrische Charakterisierung von Scheduling Problemen, Diploma Thesis, Department of Mathematics, Technical University of Berlin, Berlin, Germany, 1993.
11. A.S. Schulz, Single machine scheduling subject to N-sparse precedence constraints, in: U. Faigle and C. Hoede (eds.), 3rd Twente Workshop on Graphs and Combinatorial Optimization, Memorandum No. 1132, Faculty of Applied Mathematics, University of Twente, The Netherlands, 1993, 166-169.
12. A.S. Schulz, The permutahedron of series-parallel posets, Discrete Applied Mathematics 57 (1995) 85-90.