Country: Netherlands

Found 18376 papers in total
Two-stage heuristic algorithms for part input sequencing in flexible manufacturing systems
Two-stage heuristic algorithms for part input sequencing in flexible manufacturing systems
2001,
This paper focuses on a part input sequencing problem in flexible manufacturing...
Computational algorithms for modeling unreliable manufacturing systems based on Markovian property
Computational algorithms for modeling unreliable manufacturing systems based on Markovian property
2001,
Performance measure is a critical factor used to judge the effectiveness of a system....
Managing the impact of high market growth and learning on knowledge worker productivity and service quality
Managing the impact of high market growth and learning on knowledge worker productivity and service quality
2001,
Many high technology firms in the information technology, engineering, and internet...
A quadratic programming approach to the determination of an upper bound on the weighted stability number
A quadratic programming approach to the determination of an upper bound on the weighted stability number
2001,
In a previous work, the authors have introduced an upper bound on the stability number...
Adaptive memory programming: a unified view of metaheuristics
Adaptive memory programming: a unified view of metaheuristics
2001,
The paper analyses recent developments of a number of memory-based metaheuristics such...
The noising methods: A generalization of some metaheuristics
The noising methods: A generalization of some metaheuristics
2001,
In this paper, an exhaustive review of the principles and of the applications of the...
A simple efficient approximation scheme for the restricted shortest path problem
A simple efficient approximation scheme for the restricted shortest path problem
2001,
In this paper we give a very simple fully polynomial approximation scheme for the...
The iterated prisoner's dilemma: Early experiences with learning classifier system-based simple agents
The iterated prisoner's dilemma: Early experiences with learning classifier system-based simple agents
2001,
Prior research on artificial agents/agencies involves entities using specifically...
Modeling and simulating Poisson processes having trends or nontrigonometric cyclic effects
Modeling and simulating Poisson processes having trends or nontrigonometric cyclic effects
2001,
We formulate a nonparametric technique for estimating the (cumulative) mean-value...
Selection and sequencing heuristics to reduce variance in gas turbine engine nozzle assemblies
Selection and sequencing heuristics to reduce variance in gas turbine engine nozzle assemblies
2001,
During the maintenance of gas turbine engines, the selection and placement of nozzle...
A flexible flowshop problem with total flow time minimization
A flexible flowshop problem with total flow time minimization
2001,
In this study, we consider total flow time problem in a flexible flowshop environment....
Constructing a correlated sequence of matrix exponentials with invariant first-order properties
Constructing a correlated sequence of matrix exponentials with invariant first-order properties
2001,
In this paper, we demonstrate a method for developing analytic Markovian traffic...
Flowshop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date
Flowshop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date
2001,
We consider two problems of m -machine flowshop scheduling in this paper: one, with...
Perfect, ideal and balanced matrices
Perfect, ideal and balanced matrices
2001,
In this paper, we survey results and open problems on perfect, ideal and balanced...
Scheduling problems with a learning effect
Scheduling problems with a learning effect
2001,
In many realistic settings, the production facility (a machine, a worker) improves...
Reducing the bandwidth of a sparse matrix with tabu search
Reducing the bandwidth of a sparse matrix with tabu search
2001,
The bandwidth of a matrix A= { a ij } is defined as the maximum absolute difference...
A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times
A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times
2001,
This article proposes lower bounds, as well as a divide and merge heuristic for the...
A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
2001,
We present a new Lagrangean relaxation for the hop-constrained minimum spanning tree...
Single machine scheduling with release times, deadlines and tardiness objectives
Single machine scheduling with release times, deadlines and tardiness objectives
2001,
A polynomial time algorithm is developed to minimize maximum tardiness on a single...
Models for a Steiner ring network design problem with revenues
Models for a Steiner ring network design problem with revenues
2001,
Consider a graph G = ( V,E ), where the set of nodes V is partitioned into two sets,...
Sensitivity analysis of scheduling algorithms
Sensitivity analysis of scheduling algorithms
2001,
We are interested in this work in studying the performances of static scheduling...
Multicriteria hub decision making for rural area telecommunication networks
Multicriteria hub decision making for rural area telecommunication networks
2001,
Thanks to emerging telecommunications technologies, rural area networks (RAN) can be...
Single machine scheduling with step-deteriorating processing times
Single machine scheduling with step-deteriorating processing times
2001,
We study in this paper a scheduling model in which each task has a normal processing...
A multi-period network design problem for cellular telecommunication systems
A multi-period network design problem for cellular telecommunication systems
2001,
Mathematical Programming models for multi-period network design problems, which arise...
Papers per page: