Country: Netherlands

Found 18376 papers in total
Simulated annealing and genetic algorithms for the facility layout problem: A survey
Simulated annealing and genetic algorithms for the facility layout problem: A survey
1997,
The facility layout problem (FLP) has many practical applications and is known to be...
Modified simulated annealing algorithms for the flow-shop sequencing problem
Modified simulated annealing algorithms for the flow-shop sequencing problem
1995,
In this paper, two simulated annealing algorithms with a modified generation mechanism...
Simulated annealing for manufacturing systems layout design
Simulated annealing for manufacturing systems layout design
1995,
In this paper, we first present the general Simulated Annealing algorithm. We then...
An analysis of staffing efficiency in US manufacturing: 1983 and 1989
An analysis of staffing efficiency in US manufacturing: 1983 and 1989
1997,
A DEA framework is used to examine changes in administrative employment in US...
Stochastic annealing for synthesis under uncertainty
Stochastic annealing for synthesis under uncertainty
1995,
Simulated annealing is a recently developed combinatorial optimization technique based...
A heuristic job scheduling decision support system: A case study
A heuristic job scheduling decision support system: A case study
1996,
The daily activity of establishing a job assignment schedule for each individual...
Simulated annealing with time-dependent energy function via Sobolev inequalities
Simulated annealing with time-dependent energy function via Sobolev inequalities
1996,
We analyze the simulated annealing algorithm with an energy function U t that depends...
Towards a planning board generator
Towards a planning board generator
1996,
A planning board is a planning tool that uses the Gantt chart as its main...
Iterative averaging of entropic projections for solving stochastic convex feasibility problems
Iterative averaging of entropic projections for solving stochastic convex feasibility problems
1997,
The problem considered in this paper is that of finding a point which is common to...
A new Lagrangian relaxation based algorithm for a class of multidimensional assignment problems
A new Lagrangian relaxation based algorithm for a class of multidimensional assignment problems
1997,
Large classes of data association problems in multiple target tracking applications...
Global lower bounds for flow shops with multiple processors
Global lower bounds for flow shops with multiple processors
1995,
Flow shop with multiple processors (FSMP) scheduling involves sequencing jobs in a...
Some concave–convex representations of the quadratic assignment problem
Some concave–convex representations of the quadratic assignment problem
1995,
The quadratic assignment problem suffers from the non-convex, non-concave form of its...
Production to order on a two machine line with random yields and rigid demand
Production to order on a two machine line with random yields and rigid demand
1995,
Random yields may necessitate multiple production runs whenever demand is...
Tabu search for the multilevel generalized assignment problem
Tabu search for the multilevel generalized assignment problem
1995,
The multilevel generalized assignment problem (MGAP) differs from the classical GAP in...
Processing networks with planned inventories: Tandem queues with feedback
Processing networks with planned inventories: Tandem queues with feedback
1995,
This note continues the investigation, initiated by Lee and Zipkin, of tandem queues...
The bottleneck generalized assignment problem
The bottleneck generalized assignment problem
1995,
The min–max version of the generalized assignment problem is considered. We...
Flowshop sequencing with mean flowtime objective
Flowshop sequencing with mean flowtime objective
1995,
This paper introduces a near-optimal heuristic based on sorting methods to minimize...
A note on exact algorithms for the bottleneck generalized assignment problem
A note on exact algorithms for the bottleneck generalized assignment problem
1995,
We give a computational comparison between the algorithms of Mazzola–Neebe and...
A procedure for the one-machine sequencing problem with dependent jobs
A procedure for the one-machine sequencing problem with dependent jobs
1995,
The problem of minimizing the makespan on one machine with possible dependencies...
Distributed versus centralized storage and control for parallel branch and bound: Mixed integer programming on the CM-5
Distributed versus centralized storage and control for parallel branch and bound: Mixed integer programming on the CM-5
1997,
This paper describes parallel, non-shared-memory implementation of the classical...
Solving large quadratic assignment problems in parallel
Solving large quadratic assignment problems in parallel
1997,
Quadratic Assignment (QAPs)problems are in practice among the most difficult to solve...
A parallel depth first search branch and bound algorithm for the quadratic assignment problem
A parallel depth first search branch and bound algorithm for the quadratic assignment problem
1995,
We propose a new parallel Branch and Bound algorithm for the Quadratic Assignment...
Avoiding anomalies in the mt2 algorithm by Martello and Toth
Avoiding anomalies in the mt2 algorithm by Martello and Toth
1995,
The mt 2 algorithm by Martello and Toth for the solution of large sized 0–1...
A parallel descent algorithm for convex programming
A parallel descent algorithm for convex programming
1996,
In this paper, we propose a parallel decomposition algorithm for solving a class of...
Papers per page: