Next:
Sequencing on One Processor
Up:
A compendium of NP
Previous:
MINIMUM TREE COMPACT PACKING
Index
Sequencing and Scheduling
Sequencing and Scheduling
Sequencing on One Processor
M
AXIMUM
C
ONSTRAINED
S
EQUENCING TO
M
INIMIZE
T
ARDY
T
ASK
W
EIGHT
M
INIMUM
S
TORAGE-
T
IME
S
EQUENCING
M
INIMUM
P
RECEDENCE
C
ONSTRAINED
S
EQUENCING WITH
D
ELAYS
M
INIMUM
S
EQUENCING WITH
R
ELEASE
T
IMES
M
INIMUM
T
IME-
C
OST
T
RADEOFF
Multiprocessor Scheduling
M
INIMUM
M
ULTIPROCESSOR
S
CHEDULING
M
INIMUM
P
RECEDENCE
C
ONSTRAINED
S
CHEDULING
M
INIMUM
R
ESOURCE
C
ONSTRAINED
S
CHEDULING
M
INIMUM
P
REEMPTIVE
S
CHEDULING WITH
S
ET-
U
P
T
IMES
M
INIMUM
M
ULTIPROCESSOR
S
CHEDULING WITH
S
PEED
F
ACTORS
M
INIMUM
P
ARALLEL
P
ROCESSOR
T
OTAL
F
LOW
T
IME
M
INIMUM
W
EIGHTED
C
OMPLETION
T
IME
S
CHEDULING
M
INIMUM 3-
D
EDICATED
P
ROCESSOR
S
CHEDULING
Shop Scheduling
M
INIMUM
O
PEN-
S
HOP
S
CHEDULING
M
INIMUM
F
LOW-
S
HOP
S
CHEDULING
M
INIMUM
T
WO-
P
ROCESSOR
F
LOW-
S
HOP
S
CHEDULING WITH
B
ATCH
S
ET-
U
P
T
IMES
M
INIMUM
J
OB
S
HOP
S
CHEDULING
Miscellaneous
M
INIMUM
F
ILE
T
RANSFER
S
CHEDULING
M
INIMUM
S
CHEDULE
L
ENGTH
M
INIMUM
V
EHICLE
S
CHEDULING ON
T
REE
Viggo Kann
2000-03-20
