AAAAAA
Results: 1-25/523
Authors:
Ulusoy, G
Herroelen, W
Citation: G. Ulusoy et W. Herroelen, Project scheduling - Preface, ANN OPER R, 102, 2001, pp. 13-16
Authors:
Valls, V
Lino, P
Citation: V. Valls et P. Lino, Criticality analysis in activity-on-node networks with minimal time lags, ANN OPER R, 102, 2001, pp. 17-37
Authors:
Bowman, RA
Citation: Ra. Bowman, Due date-based metrics for activity importance in stochastic activity networks, ANN OPER R, 102, 2001, pp. 39-48
Authors:
Ludwig, A
Mohring, RH
Stork, F
Citation: A. Ludwig et al., A computational study on bounding the makespan distribution in stochastic project networks, ANN OPER R, 102, 2001, pp. 49-64
Authors:
Tormos, P
Lova, A
Citation: P. Tormos et A. Lova, A competitive heuristic solution technique for Resource-Constrained Project Scheduling, ANN OPER R, 102, 2001, pp. 65-81
Authors:
Alcaraz, J
Maroto, C
Citation: J. Alcaraz et C. Maroto, A robust genetic algorithm for resource allocation in project scheduling, ANN OPER R, 102, 2001, pp. 83-109
Authors:
Hartmann, S
Citation: S. Hartmann, Project scheduling with multiple modes: A genetic algorithm, ANN OPER R, 102, 2001, pp. 111-135
Authors:
Jozefowska, J
Mika, M
Rozycki, R
Waligora, G
Weglarz, J
Citation: J. Jozefowska et al., Simulated annealing for multi-mode resource-constrained project scheduling, ANN OPER R, 102, 2001, pp. 137-155
Authors:
Ozdamar, L
Alanya, E
Citation: L. Ozdamar et E. Alanya, Uncertainty modelling in software development projects (with case study), ANN OPER R, 102, 2001, pp. 157-178
Authors:
Vanhoucke, M
Demeulemeester, E
Herroelen, W
Citation: M. Vanhoucke et al., An exact procedure for the resource-constrained weighted earliness-tardiness project scheduling problem, ANN OPER R, 102, 2001, pp. 179-196
Authors:
Dayanand, N
Padman, R
Citation: N. Dayanand et R. Padman, A two stage search heuristic for scheduling payments in projects, ANN OPER R, 102, 2001, pp. 197-220
Authors:
Kimms, A
Citation: A. Kimms, Maximizing the net present value of a project under resource constraints using a Lagrangian relaxation based heuristic with tight upper bounds, ANN OPER R, 102, 2001, pp. 221-236
Authors:
Ulusoy, G
Sivrikaya-Serifoglu, F
Sahin, S
Citation: G. Ulusoy et al., Four payment models for the multi-mode resource constrained project scheduling problem with discounted cash flows, ANN OPER R, 102, 2001, pp. 237-261
Authors:
Lova, A
Tormos, P
Citation: A. Lova et P. Tormos, Analysis of scheduling schemes and heuristic rules performance in resource-constrained multiproject scheduling, ANN OPER R, 102, 2001, pp. 263-286
Authors:
Lee, CY
Lei, L
Citation: Cy. Lee et L. Lei, Multiple-project scheduling with controllable project duration and hard resource constraint: Some solvable cases, ANN OPER R, 102, 2001, pp. 287-307
Authors:
Klatte, D
Ruckmann, JJ
Ward, DE
Citation: D. Klatte et al., Optimization with data perturbations II, ANN OPER R, 101, 2001, pp. 13-22
Authors:
Felgenhauer, U
Citation: U. Felgenhauer, On smoothness properties and approximability of optimal control functions, ANN OPER R, 101, 2001, pp. 23-42
Authors:
Malanowski, K
Maurer, H
Citation: K. Malanowski et H. Maurer, Sensitivity analysis for optimal control problems subject to higher order state constraints, ANN OPER R, 101, 2001, pp. 43-73
Authors:
Augustin, D
Maurer, H
Citation: D. Augustin et H. Maurer, Computational sensitivity analysis for state constrained optimal control problems, ANN OPER R, 101, 2001, pp. 75-99
Authors:
Alt, W
Citation: W. Alt, Mesh-independence of the Lagrange-Newton method for nonlinear optimal control problems and their discretizations, ANN OPER R, 101, 2001, pp. 101-117
Authors:
Schochetman, IE
Smith, RL
Citation: Ie. Schochetman et Rl. Smith, A finite algorithm for solving infinite dimensional optimization problems, ANN OPER R, 101, 2001, pp. 119-142
Authors:
Kainen, PC
Kurkova, V
Vogt, A
Citation: Pc. Kainen et al., Continuity of approximation by neural networks in L-p spaces, ANN OPER R, 101, 2001, pp. 143-147
Authors:
Mordukhovich, BS
Trubnik, R
Citation: Bs. Mordukhovich et R. Trubnik, Stability of discrete approximations and necessary optimality conditions for delay-differential inclusions, ANN OPER R, 101, 2001, pp. 149-170
Authors:
Canovas, MJ
Lopez, MA
Parra, J
Todorov, MI
Citation: Mj. Canovas et al., Solving strategies and well-posedness in linear semi-infinite programming, ANN OPER R, 101, 2001, pp. 171-190
Authors:
Ruckmann, JJ
Stein, O
Citation: Jj. Ruckmann et O. Stein, On linear and linearized generalized semi-infinite optimization problems, ANN OPER R, 101, 2001, pp. 191-208