nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An algorithm for source location in directed graphs
|
Bárász, Mihály |
|
2005 |
33 |
3 |
p. 221-230 10 p. |
artikel |
2 |
A polynomial algorithm for no-wait cyclic hoist scheduling in an extended electroplating line
|
Che, Ada |
|
2005 |
33 |
3 |
p. 274-284 11 p. |
artikel |
3 |
A polynomial-time algorithm for the change-making problem
|
Pearson, David |
|
2005 |
33 |
3 |
p. 231-234 4 p. |
artikel |
4 |
A polynomial-time algorithm to find an equitable home–away assignment
|
Miyashiro, Ryuhei |
|
2005 |
33 |
3 |
p. 235-241 7 p. |
artikel |
5 |
Approximation of the supply scheduling problem
|
Chauhan, Satyaveer S. |
|
2005 |
33 |
3 |
p. 249-254 6 p. |
artikel |
6 |
Delayed demand information and dampened bullwhip effect
|
Zhang, Xiaolong |
|
2005 |
33 |
3 |
p. 289-294 6 p. |
artikel |
7 |
Distribution center consolidation games
|
Klijn, Flip |
|
2005 |
33 |
3 |
p. 285-288 4 p. |
artikel |
8 |
Editorial Board
|
|
|
2005 |
33 |
3 |
p. IFC- 1 p. |
artikel |
9 |
Inverse conic programming with applications
|
Iyengar, Garud |
|
2005 |
33 |
3 |
p. 319-330 12 p. |
artikel |
10 |
Level-crossing approach to a time-limited service system with two types of vacations
|
Katayama, Tsuyoshi |
|
2005 |
33 |
3 |
p. 295-300 6 p. |
artikel |
11 |
Minimizing flow time on a constant number of machines with preemption
|
Bansal, Nikhil |
|
2005 |
33 |
3 |
p. 267-273 7 p. |
artikel |
12 |
On complexity of unconstrained hyperbolic 0–1 programming problems
|
Prokopyev, Oleg A. |
|
2005 |
33 |
3 |
p. 312-318 7 p. |
artikel |
13 |
Optimization with additional variables and constraints
|
Jüttner, Alpár |
|
2005 |
33 |
3 |
p. 305-311 7 p. |
artikel |
14 |
The maximum saving partition problem
|
Hassin, Refael |
|
2005 |
33 |
3 |
p. 242-248 7 p. |
artikel |
15 |
The m -machine flowshop problem with unit-time operations and intree precedence constraints
|
Averbakh, Igor |
|
2005 |
33 |
3 |
p. 263-266 4 p. |
artikel |
16 |
Two-machine flow shop scheduling problems with no-wait jobs
|
Bouquard, J.-L. |
|
2005 |
33 |
3 |
p. 255-262 8 p. |
artikel |
17 |
When does the c μ rule apply to finite-population queueing systems?
|
Iravani, Seyed M.R. |
|
2005 |
33 |
3 |
p. 301-304 4 p. |
artikel |