| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A linear programming approach to stability, optimisationand performance analysis for Markovian multiclassqueueing networks
|
Glazebrook, K.D.
|
|
1999
|
92 |
0 |
p. 1-18
|
article
|
| 2 |
Almost optimal policies for stochastic systemswhich almost satisfy conservation laws
|
Glazebrook, K.D.
|
|
1999
|
92 |
0 |
p. 19-43
|
article
|
| 3 |
An algorithm for minimum wait drainingof two‐station fluid re‐entrant line
|
Weiss, G.
|
|
1999
|
92 |
0 |
p. 65-86
|
article
|
| 4 |
A new lower bound for the open‐shop problem
|
Guéret, C.
|
|
1999
|
92 |
0 |
p. 165-183
|
article
|
| 5 |
A polynomial algorithm for the three‐machineopen shop with a bottleneck machine
|
Drobouchevitch, I.G.
|
|
1999
|
92 |
0 |
p. 185-210
|
article
|
| 6 |
Cardinality constrained bin‐packing problems
|
Kellerer, H.
|
|
1999
|
92 |
0 |
p. 335-348
|
article
|
| 7 |
Heuristic algorithms for job‐shop scheduling problemswith stochastic precedence constraints
|
Neumann, K.
|
|
1999
|
92 |
0 |
p. 45-63
|
article
|
| 8 |
On the hardness of the classical job shop problem
|
Bräsel, H.
|
|
1999
|
92 |
0 |
p. 265-279
|
article
|
| 9 |
On the set of solutions of the open shop problem
|
Bräsel, H.
|
|
1999
|
92 |
0 |
p. 241-263
|
article
|
| 10 |
Preface
|
|
|
1999
|
92 |
0 |
p. 0
|
article
|
| 11 |
Recovering cyclic schedules from delay
|
Wegner, R.
|
|
1999
|
92 |
0 |
p. 143-164
|
article
|
| 12 |
Satisfiability tests and time‐bound adjustmentsfor cumulative scheduling problems
|
Baptiste, Ph.
|
|
1999
|
92 |
0 |
p. 305-333
|
article
|
| 13 |
Scheduling a round robin tennis tournamentunder courts and players availability constraints
|
Della Croce, F.
|
|
1999
|
92 |
0 |
p. 349-361
|
article
|
| 14 |
Scheduling chicken catching ‐ An investigationinto the success of a genetic algorithm on areal‐world scheduling problem
|
Hart, E.
|
|
1999
|
92 |
0 |
p. 363-380
|
article
|
| 15 |
Scheduling multi‐operation jobs on a single machine
|
Gerodimos, A.E.
|
|
1999
|
92 |
0 |
p. 87-105
|
article
|
| 16 |
Shop‐scheduling problems with fixed and non‐fixedmachine orders of the jobs
|
Shakhlevich, N.V.
|
|
1999
|
92 |
0 |
p. 281-304
|
article
|
| 17 |
Single‐machine scheduling to minimize maximumtardiness with minimum number of tardy jobs
|
Gupta, J.N.D.
|
|
1999
|
92 |
0 |
p. 107-123
|
article
|
| 18 |
The setup polytope of N‐sparse posets
|
Schrader, R.
|
|
1999
|
92 |
0 |
p. 125-142
|
article
|
| 19 |
The simultaneous determination of the assignment ofitems to resources, the cycle times, and the reorderintervals in repetitive PCB assembly
|
van Zante-de Fokkert, J.I.
|
|
1999
|
92 |
0 |
p. 381-401
|
article
|
| 20 |
When difference in machine loads leadsto efficient scheduling in open shops
|
Kononov, A.
|
|
1999
|
92 |
0 |
p. 211-239
|
article
|
Journal description