Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Discrete Appl.~Math. AND Volume=72
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Some models for scheduling parallel programs with communication delays
Evripidis Bampis
,
Frédéric Guinand
,
Denis Trystram
Discrete Applied Mathematics
72
(1-2), 1997, pp. 5-24
Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness
L. Bianco
,
J. Bƚażewicz
,
P. Dell'Olmo
,
M. Drozdowski
Discrete Applied Mathematics
72
(1-2), 1997, pp. 25-46
Improving local search heuristics for some scheduling problems. Part II
Peter Brucker
,
Johann Hurink
,
Frank Werner
Discrete Applied Mathematics
72
(1-2), 1997, pp. 47-69
Comparability graph augmentation for some multiprocessor scheduling problems
P. Dell'Olmo
,
M. Grazia Speranza
,
Zs. Tuza
Discrete Applied Mathematics
72
(1-2), 1997, pp. 71-84
b9000A 1/4 approximate algorithm for P2/tree/Cmax
Giorgio Gallo
,
Fulvio Piccinonno
Discrete Applied Mathematics
72
(1-2), 1997, pp. 85-98
Scheduling with batching: Two job types
Dorit S. Hochbaum
,
Dan Landy
Discrete Applied Mathematics
72
(1-2), 1997, pp. 99-114
Algorithms for minclique scheduling problems
Bernd Jurisch
,
Wieslaw Kubiak
,
Joanna Józefowska
Discrete Applied Mathematics
72
(1-2), 1997, pp. 115-139
On the complexity of coupled-task scheduling
A.J. Orman
,
C.N. Potts
Discrete Applied Mathematics
72
(1-2), 1997, pp. 141-154
Scheduling with forbidden sets
Markus W. Schäffter
Discrete Applied Mathematics
72
(1-2), 1997, pp. 155-166
Minimizing the number of tardy jobs with precedence constraints and agreeable due dates
George Steiner
Discrete Applied Mathematics
72
(1-2), 1997, pp. 167-177
Facets of the generalized permutahedron of a poset
Annelie von Arnim
,
Andreas S. Schulz
Discrete Applied Mathematics
72
(1-2), 1997, pp. 179-192
A new version of on-line variable-sized bin packing
Guochuan Zhang
Discrete Applied Mathematics
72
(3), 1997, pp. 193-197
A
d
-move local permutation routing for the
d
-cube
Frank K. Hwang
,
Y.C. Yao
,
Miltos D. Grammatikakis
Discrete Applied Mathematics
72
(3), 1997, pp. 199-207
An algorithm for finding homogeneous pairs
Hazel Everett
,
Sulamita Klein
,
Bruce Reed
Discrete Applied Mathematics
72
(3), 1997, pp. 209-218
Lifting cover inequalities for the precedence-constrained knapsack problem
Kyungchul Park
,
Sungsoo Park
Discrete Applied Mathematics
72
(3), 1997, pp. 219-241
Batch scheduling in a two-machine flow shop with limited buffer
A. Agnetis
,
D. Pacciarelli
,
F. Rossi
Discrete Applied Mathematics
72
(3), 1997, pp. 243-260
Bond graphs I: Acausal equivalence
J.D. Lamb
,
D.R. Woodall
,
G.M. Asher
Discrete Applied Mathematics
72
(3), 1997, pp. 261-293
Hexagonal systems with forcing single edges
Xueliang Li
Discrete Applied Mathematics
72
(3), 1997, pp. 295-301