A

Arnim, Annelie von and Faigle, Ulrich and Schrader, Rainer (1990) The permutahedron of series-parallel posets.
Published in: Discrete Applied Mathematics Vol. 28 (1). pp. 3-9.

Arnim, Annelie von and Schrader, Rainer and Wang, Yaoguang (1996) The Permutahedron of N-sparse Posets.
Published in: Mathematical programming : Series A Vol. 75 (1). pp. 1-18.

Arnim, Annelie von and Schulz, Andreas S. (1997) Facets of the generalized permutahedron of a poset.
Published in: Discrete Applied Mathematics Vol. 72 (1-2). pp. 179-192.

B

Baas, S. M. and Kern, Walter and Nawijn, W. M. (1990) Scheduling Jobs on Parallel Machines, each with a Unit-Capacity Buffer.
Technical Report , 30 p.

Bachem, Achim and Bodmann, M. and Bolz, Georg and Emden-Weinert, Thomas and Erdmann, Andreas and Monien, Burkhard and Kiahaschemi, Mehran and Prömel, Hans J. and Schepers, Jörg and Schrader, Rainer and Schulze, Jürgen and Tschöke, Stefan (1997) Verbundprojekt PARALOR: Parallele Verfahren zur Wegoptimierung in Flugplanung und Logistik.
Published In: Paralleles Höchstleistungsrechnen und seine Anwendungen : Statustagung des BMBF ; HPSC 97 ; 25. - 26. Februar 1997, München DLR 1997, pp. 181-197.

Bachem, Achim and Monien, Burkhard and Prömel, Hans J. and Schrader, Rainer and Voigt, Bernd (1996) Verbundprojekt PARALOR: Parallele Algorithmen für Routingprobleme im Flug- und Straßenverkehr.
Published In: Stand und Perspektiven des Parallelen Höchstleistungsrechnens und seiner Anwendungen : Statustagung des BMBF HPSC 95, 11. - 14. September 1995, Jülich 1996.

E

Epping, Thomas and Hochstättler, Winfried and Oertel, Peter (2004) Complexity Results on a Paint Shop Problem.
Published in: Discrete Applied Mathematics Vol. 136 (2-3). pp. 217-226.

Epping, Thomas and Hochstättler, Winfried and Oertel, Peter (2001) Some Results on a Paint Shop Problem for Words.
Published In: Electronic Notes in Discrete Mathematics 8 Elsevier 2001, pp. 31-33.

F

Faigle, Ulrich and Schrader, Rainer (1984) Minimizing completion time for a class of scheduling problems.
Published in: Information Processing Letters Vol. 19 (1). pp. 27-29.

G

Genc, Zuelfuekar and Speckenmeyer, Ewald (2001) Fahrplanoptimierung im ÖPNV.
Technical Report , 7 p.

Grötschel, Martin and Jünger, Michael and Reinelt, Gerhard (1984) A Cutting Plane Algorithm for the Linear Ordering Problem.
Published in: Operations Research Vol. 32 (6). pp. 1195-1220.

H

Heinrichs, Udo and Moll, Christoph (1997) On the scheduling of one-dimensional transport systems.
Technical Report , 18 p.

L

Leclerc, Matthias and Rendl, Franz (1989) A Multiply Constrained Matroid Optimization Problem.
Published in: Discrete mathematics Vol. 73 (1-2). pp. 207-212.

M

Mallach, Sven (2021) A note on labeling methods to schedule unit execution time tasks in the presence of delayed precedence constraints.

N

Nawijn, W. M. and Kern, Walter and Baas, S. M. (1990) Minimum Loss Scheduling.
Technical Report , 30 p.

S

Schrader, Rainer and Wambach, Georg (1994) Integer polyhedra from supermodular functions on series-parallel posets.
Technical Report , 13 p.

Schrader, Rainer and Wambach, Georg (1997) The Setup Polyhedron of Series-Parallel Posets.
Published in: Discrete Applied Mathematics Vol. 79 (1-3). pp. 213-221.

Schrader, Rainer and Wambach, Georg (1999) The setup polytope of N-sparse posets.
Published in: Annals of Operations Research Vol. 92. pp. 125-142.

Srivastav, Anand and Stangier, Peter (1996) Algorithmic Chernoff-Hoeffding Inequalities in Integer Programming.
Published In: Algorithms and Computation : 5th International Symposium, ISAAC '94 Beijing, P. R. China, August 2527, 1994 Proceedings, Lecture notes in computer science. 834 Springer 1996, pp. 226-233.

Srivastav, Anand and Stangier, Peter (1996) Algorithmic Chernoff-Hoeffding Inequalities in Integer Programming.
Published in: Random structures & algorithms Vol. 8 (1). pp. 27-58.

Srivastav, Anand and Stangier, Peter (1994) Tight Approximation for Resource Constrained Scheduling and Bin Packing.
Published In: Algorithms ESA '94 : Second Annual European Symposium Utrecht, The Netherlands, September 26 - 28, 1994 Proceedings, Lecture notes in computer science. 855 Springer 1994, pp. 307-318.

Srivastav, Anand and Stangier, Peter (1997) Tight Approximation for Resource Constrained Scheduling and Bin Packing.
Published in: Discrete Applied Mathematics Vol. 79 (1-3). pp. 223-245.