Country: Netherlands

Found 18376 papers in total
Determination of weights of interacting criteria from a reference set
Determination of weights of interacting criteria from a reference set
2000,
In this paper, we present a model allowing to determine the weights related to...
On symmetric duality in multiobjective programming: Some remarks on recent results
On symmetric duality in multiobjective programming: Some remarks on recent results
2000,
Certain shortcomings are pointed out in some recent works of Das and Nanda and Kim et...
An algorithm for the multiparametric 0–1-integer linear programming problem relative to the objective function
An algorithm for the multiparametric 0–1-integer linear programming problem relative to the objective function
2000,
The multiparametric 0–1-Integer Linear Programming (0–1-ILP) problem...
A hybrid genetic algorithm for the open shop scheduling problem
A hybrid genetic algorithm for the open shop scheduling problem
2000,
This paper examines the development and application of a hybrid genetic algorithm...
ProGen/πx – an instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions
ProGen/πx – an instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions
2000,
Project scheduling has long been an area of intensive research, but until recently...
A simple duality proof in convex quadratic programming with a quadratic constraint, and some applications
A simple duality proof in convex quadratic programming with a quadratic constraint, and some applications
2000,
In this paper a simple derivation of duality is presented for convex quadratic...
A note on ‘project scheduling with resource constraints: A branch and bound approach’
A note on ‘project scheduling with resource constraints: A branch and bound approach’
2000,
This note points out an incorrect Lagrangian relaxation used in the study by...
Scheduling a flowline manufacturing cell with sequence dependent family setup times
Scheduling a flowline manufacturing cell with sequence dependent family setup times
2000,
This paper considers the problem of scheduling part families and jobs within each part...
Basis- and partition identification for quadratic programming and linear complementarity problems
Basis- and partition identification for quadratic programming and linear complementarity problems
1999,
Optimal solutions of interior point algorithms for linear and quadratic programming...
Minimizing makespan subject to minimum total flow-time on identical parallel machines
Minimizing makespan subject to minimum total flow-time on identical parallel machines
2000,
This paper considers the identical parallel-machine scheduling problem of minimizing...
A note on composite concave quadratic programming
A note on composite concave quadratic programming
1998,
In this paper we present a pivotal-based algorithm for the global minimization of...
An improved precedence rule for single machine sequencing problems with quadratic penalty
An improved precedence rule for single machine sequencing problems with quadratic penalty
2000,
This article introduces a new heuristic for the single machine job sequencing problem...
On three-machine flow shops with random job processing times
On three-machine flow shops with random job processing times
2000,
The paper deals with scheduling n jobs on three machines in Johnson's flow shops. The...
A computational study of smoothing heuristics for the traveling salesman problem
A computational study of smoothing heuristics for the traveling salesman problem
2000,
Over the last five years or so, data smoothing has been used to improve the...
A two machine bicriteria scheduling problem
A two machine bicriteria scheduling problem
2000,
In this paper we consider the bicriteria problem of scheduling n jobs on two parallel...
Application of the noising method to the travelling salesman problem
Application of the noising method to the travelling salesman problem
2000,
In this paper, we study the application of the noising method, a recent combinatorial...
Solvable cases of permutation flowshop scheduling with dominating machines
Solvable cases of permutation flowshop scheduling with dominating machines
2000,
In this paper we study the permutation flowshop scheduling problem with an increasing...
Evaluation of the potential benefits of lot streaming in flow-shop systems
Evaluation of the potential benefits of lot streaming in flow-shop systems
2000,
Lot streaming is the process of splitting a production lot into sublots, and then...
Higher order approximations for the single server queue with splitting, merging and feedback
Higher order approximations for the single server queue with splitting, merging and feedback
2000,
The performance evaluation of many modern communication and manufacturing systems has...
A note on ‘An efficient algorithm for the single-machine tardiness problem.’
A note on ‘An efficient algorithm for the single-machine tardiness problem.’
2000,
The focus of this work is to give some comments on a paper recently published by...
Efficient storage allocation for processing in backlog-controlled queueing networks using multicriteria techniques
Efficient storage allocation for processing in backlog-controlled queueing networks using multicriteria techniques
2000,
Problems of efficient storage allocation arise in many real situations in which there...
Queues with a variable number of servers
Queues with a variable number of servers
2000,
In modern communication networks such as the broadband integrated services digital...
New bounds for expected cycle times in tandem queues with blocking
New bounds for expected cycle times in tandem queues with blocking
2000,
Tandem queues with finite buffers have been widely discussed as basic models of...
Diffusion approximations for Kumar–Seidman network under a priority service discipline
Diffusion approximations for Kumar–Seidman network under a priority service discipline
1998,
Unlike for a single-class queueing network, diffusion approximations for a multiclass...
Papers per page: