# Discrete Applied Mathematics

Discrete Applied Mathematics > 1997 > 72 > 1-2 > 141-154

Discrete Applied Mathematics > 1997 > 72 > 1-2 > 71-84

Discrete Applied Mathematics > 1997 > 72 > 1-2 > 5-24

Discrete Applied Mathematics > 1997 > 72 > 1-2 > 155-166

_{m}

_{a}

_{x}. This problem is NP hard even for unit task length and forbidden sets that contains exactly...

Discrete Applied Mathematics > 1997 > 72 > 1-2 > 47-69

_{m}

_{a}

_{x}, 1 prec U

_{i}, and a large class of sequencing problems with precedence constraints having local interchange properties we replace a simple neighborhood...

Discrete Applied Mathematics > 1997 > 72 > 1-2 > 99-114

_{1}jobs with weight w

_{1}, and n

_{2}jobs with weight w

_{2}, all having processing time p, and given a batch setup time Δ, find a sequence of batches of jobs such that the weighted sum of the n = n

_{1}+ n

_{2}job completion times is minimized. The algorithm has running time O(n...

Discrete Applied Mathematics > 1997 > 72 > 1-2 > 179-192

Discrete Applied Mathematics > 1997 > 72 > 1-2 > 167-177

Discrete Applied Mathematics > 1997 > 72 > 1-2 > 85-98

Discrete Applied Mathematics > 1997 > 72 > 1-2 > 25-46

Discrete Applied Mathematics > 1997 > 72 > 1-2 > 115-139

Discrete Applied Mathematics > 1997 > 72 > 3 > 219-241

Discrete Applied Mathematics > 1997 > 72 > 3 > 261-293

Discrete Applied Mathematics > 1997 > 72 > 3 > 209-218

_{1},Q

_{2}} of disjoint sets of vertices in this graph such that every vertex of V \ (Q

_{1}Q

_{2}) is adjacent either to all vertices ofQ

_{1}or to none of the vertices of Q

_{1}and is adjacent either to all vertices of Q

_{2}or to none of the vertices of Q

_{2}. Also Q

_{1}2 or Q ...

Discrete Applied Mathematics > 1997 > 72 > 3 > 199-207

Discrete Applied Mathematics > 1997 > 72 > 3 > 295-301

Discrete Applied Mathematics > 1997 > 72 > 3 > 243-260