Country: Netherlands

Found 18376 papers in total
A comparative study of computational procedures for the resource constrained project scheduling problem
A comparative study of computational procedures for the resource constrained project scheduling problem
1994,
Performance of two new integer programming based heuristics together with some special...
Comment on Elmaghraby and Herroelen’s ‘The scheduling of activities to maximize the net present value of projects’
Comment on Elmaghraby and Herroelen’s ‘The scheduling of activities to maximize the net present value of projects’
1994,
In a recent paper, Elmaghraby and Herroelen have presented an algorithm to maximize...
A bibliography for the development of an intelligent mathematical programming system
A bibliography for the development of an intelligent mathematical programming system
1996,
The purpose of this paper is to provide references in the rapidly growing area of...
Effect of quality loss functions on the economic design of nx process control charts
Effect of quality loss functions on the economic design of nx process control charts
1994,
There has been considerable research on the economic design of Statistical Process...
An algorithm for computing the economically optimal nàX-control chart for a process with multiple assignable causes
An algorithm for computing the economically optimal nàX-control chart for a process with multiple assignable causes
1994,
The main difficulties in the use of economic designs are the computations involved,...
Large step volumetric potential reduction algorithms for linear programming
Large step volumetric potential reduction algorithms for linear programming
1996,
The paper considers the construction of potential reduction algorithms using...
New complexity results for the Iri-Imai method
New complexity results for the Iri-Imai method
1996,
In this paper, the authors show that the number of main iterations required by the...
Computational experience with penalty-barrier methods for nonlinear programming
Computational experience with penalty-barrier methods for nonlinear programming
1996,
It was recently shown that modified barrier methods are not only theoretically but...
Performance approximation of pick-to-belt orderpicking systems
Performance approximation of pick-to-belt orderpicking systems
1994,
In this paper, an approximation method is discussed for the analysis of pick-to-belt...
Scenario-based stochastic programs: Resistance with respect to sample
Scenario-based stochastic programs: Resistance with respect to sample
1996,
A contamination technique is presented as a numerically tractable tool to...
Parallel decomposition of large-scale stochastic nonlinear programs
Parallel decomposition of large-scale stochastic nonlinear programs
1996,
Many practical decision problems involve both nonlinear relationships and...
On the formulation of stochastic linear programs using algebraic modelling languages
On the formulation of stochastic linear programs using algebraic modelling languages
1996,
This paper considers extensions to algebraic modelling languages to support...
A parallel inexact Newton method for stochastic programs with recourse
A parallel inexact Newton method for stochastic programs with recourse
1996,
A parallel inexact Newton method with a line search is proposed for two-stage...
Second-order scenario approximation and refinement in optimization under uncertainty
Second-order scenario approximation and refinement in optimization under uncertainty
1996,
When solving scenario-based stochastic programming problems, it is imperative that the...
The short-run shutdown decision when output price and initial wealth are random
The short-run shutdown decision when output price and initial wealth are random
1994,
This paper extends the research of Hori and Chavas by investigating the short-run...
On augmented Lagrangian decomposition methods for multistage stochastic programs
On augmented Lagrangian decomposition methods for multistage stochastic programs
1996,
A general decomposition framework for large convex optimization problems based on...
An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times
An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times
1994,
The paper deals with a single-machine scheduling problem with release times, delivery...
An interior point method for general large-scale quadratic programming problems
An interior point method for general large-scale quadratic programming problems
1996,
In this paper, the authors present an interior point algorithm for solving both convex...
Study of a NP-hard cyclic scheduling problem: The recurrent job-shop
Study of a NP-hard cyclic scheduling problem: The recurrent job-shop
1994,
This paper tackles a cyclic scheduling problem with disjunctive resources called the...
Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment
Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment
1994,
Scheduling in a flow shop with multiple processors (FSMP) involves the sequencing of n...
A polynomial algorithm for the [n/m/0,tij=1, tree/Cmax] open shop problem
A polynomial algorithm for the [n/m/0,tij=1, tree/Cmax] open shop problem
1994,
In this paper the authors consider the open shop problem with unit processing times...
Weighted matching with vertex weights: An application to scheduling training sessions in NASA space shuttle cockpit simulators
Weighted matching with vertex weights: An application to scheduling training sessions in NASA space shuttle cockpit simulators
1994,
Necessary and sufficient conditions are provided for optimality of a matching in a...
Scheduling jobs of equal length: Complexity, facets and computational results
Scheduling jobs of equal length: Complexity, facets and computational results
1996,
The following problem was originally motivated by a question arising in the automated...
Ordinal algorithms for parallel machine scheduling
Ordinal algorithms for parallel machine scheduling
1996,
The minimization of maximum completion time for scheduling n jobs on m identical...
Papers per page: