Country: Netherlands

Found 18376 papers in total
Sequencing jobs on a single machine with a common due date and stochastic processing times
Sequencing jobs on a single machine with a common due date and stochastic processing times
1991,
This paper presents a procedure for sequencing jobs on a single machine with jobs...
Approximation algorithms for single-machine sequencing with delivery times and unit batch set-up times
Approximation algorithms for single-machine sequencing with delivery times and unit batch set-up times
1991,
The single machine sequencing problem is considered in which a set of n jobs is...
Mathematical programming formulations for machine scheduling: A survey
Mathematical programming formulations for machine scheduling: A survey
1991,
Machine scheduling was and still is a rich and promising field for research with...
Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
1991,
This paper presents extensions and further analytical properties of algorithms for...
Optimal assignment of slack due-dates and sequencing of jobs with random processing times on a single machine
Optimal assignment of slack due-dates and sequencing of jobs with random processing times on a single machine
1991,
This paper considers the problem of due-date assignment and sequencing of n...
Solving knapsack sharing problems with general tradeoff functions
Solving knapsack sharing problems with general tradeoff functions
1991,
A knapsack sharing problem is a maximin or minimax mathematical programming problem...
Algorithms for a class of single-machine weighted tardiness and earliness problems
Algorithms for a class of single-machine weighted tardiness and earliness problems
1991,
The authors address the problem of determining schedules for static, single-machine...
A new heuristic for the n-job, M-machine flow-shop problem
A new heuristic for the n-job, M-machine flow-shop problem
1991,
This paper describes a new improvement for solving the flow-shop scheduling problem....
Computing a global optimal solution to a design centering problem
Computing a global optimal solution to a design centering problem
1992,
In this paper the authors present a method for solving a special three-dimensional...
A time indexed formulation of non-preemptive single machine scheduling problems
A time indexed formulation of non-preemptive single machine scheduling problems
1992,
The authors consider the formulation of non-preemptive single machine scheduling...
A note on a characterization of P-matrices
A note on a characterization of P-matrices
1992,
In this note the authors show that the characterization results for P-matrices due to...
A polynomial algorithm for a one machine batching problem
A polynomial algorithm for a one machine batching problem
1992,
A problem of batching identical jobs on a single machine is studied. Constant...
A network penalty method
A network penalty method
1991,
The authors consider the minimum cost network flow problem and describe how the...
An iteration potential reduction algorithm for linear complementarity problems
An iteration potential reduction algorithm for linear complementarity problems
1991,
This paper proposes an interior point algorithm for a positive semi-definite linear...
Solving (large scale) matching problems combinatorially
Solving (large scale) matching problems combinatorially
1991,
In this paper the authors describe computational results for a modification of the...
Use of dynamic trees in a network simplex algorithm for the maximum flow problem
Use of dynamic trees in a network simplex algorithm for the maximum flow problem
1991,
Goldfarb and Hao have proposed a pivot rule for the primal network simplex algorithm...
Finding minimum-cost flows by double scaling
Finding minimum-cost flows by double scaling
1992,
Several researchers have recently developed new techniques that give fast algorithms...
A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure
A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure
1992,
This paper develops a decomposition method using a pricing mechanism which has been...
Convergence of a generalized subgradient method for nondifferentiable convex optimization
Convergence of a generalized subgradient method for nondifferentiable convex optimization
1991,
A generalized subgradient method is considered which uses the subgradients at previous...
Effort associated with a class of random optimization methods
Effort associated with a class of random optimization methods
1991,
When differentiability is not assumed random procedures can be successfully used to...
On the optimal assembly of series-parallel systems
On the optimal assembly of series-parallel systems
1992,
A heuristic for the optimal assembly of series-parallel systems is proposed. An...
The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients
The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients
1991,
The main purpose of this paper is the extension of Powell’s global convergence...
Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths
Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths
1991,
An exact algorithm is presented for determining the interval chromatic number of a...
Convergence of quasi-Newton matrices generated by the symmetric rank one update
Convergence of quasi-Newton matrices generated by the symmetric rank one update
1991,
Quasi-Newton algorithms for unconstrained nonlinear minimization generate a sequence...
Papers per page: