Journal: Computers and Operations Research

Found 2748 papers in total
The quickest path problem with interval lead times
The quickest path problem with interval lead times
2004,
in this paper, a version of the quickest path problem is considered in which arc...
Finding the first k shortest paths in a time-window network
Finding the first k shortest paths in a time-window network
2004,
The time-constrained shortest path problem is an important generalization of the...
An empirical study of impact of crossover operators on the performance of non-binary genetic algorithm based neural approaches for classification
An empirical study of impact of crossover operators on the performance of non-binary genetic algorithm based neural approaches for classification
2004,
We study the performance of genetic algorithm (GA) based artificial neural network...
A new filled function applied to global optimization
A new filled function applied to global optimization
2004,
The filled function method is an approach to find the global minimiser of multi-modal...
On bottleneck assignment problems under categorization
On bottleneck assignment problems under categorization
2004,
In this note we consider two types of bottleneck assignment problems under...
A queueing control model for retail services having back room operations and cross-trained workers
A queueing control model for retail services having back room operations and cross-trained workers
2004,
Many retail service facilities have both front room and back room operations, The...
The effect of workers with different capabilities on customer delay
The effect of workers with different capabilities on customer delay
2004,
Many service facilities operate seven days per week. The operations managers of these...
A branch & bound algorithm for the 0–1 mixed integer knapsack problem with linear multiple choice constraints
A branch & bound algorithm for the 0–1 mixed integer knapsack problem with linear multiple choice constraints
2004,
This paper presents a branch and bound (B&B) algorithm for the 0–1 mixed...
A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
2004,
This paper addresses the m -machine flowshop problem with the objective of minimizing...
On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties
On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties
2004,
In this paper, the complexity and some other properties of several multi-stage...
A tabu search algorithm for parallel machine total tardiness problem
A tabu search algorithm for parallel machine total tardiness problem
2004,
In this study, we consider the problem of scheduling a set of independent jobs with...
Scheduling under machine breakdown in a continuous process industry
Scheduling under machine breakdown in a continuous process industry
2004,
In many continuous process industries, machine breakdowns may affect the planned...
Scheduling parallel machines by the dynamic newsboy problem
Scheduling parallel machines by the dynamic newsboy problem
2004,
The newsboy problem is a well-known operations research model. Its various extensions...
A note on a due-date assignment on a two-machine flow-shop
A note on a due-date assignment on a two-machine flow-shop
2004,
We address a due-date assignment and scheduling problem in a two-machine flow-shop...
Improved genetic algorithm for the permutation flowshop scheduling problem
Improved genetic algorithm for the permutation flowshop scheduling problem
2004,
Genetic algorithms (GAs) are search heuristics used to solve global optimization...
Insertion of a random bitask in a schedule: a real-time approach
Insertion of a random bitask in a schedule: a real-time approach
2004,
We consider a schedule of bitasks. A bitask is a pair of tasks separated by an idle...
An ant colony system for permutation flow-shop sequencing
An ant colony system for permutation flow-shop sequencing
2004,
Ant colony system (ACS) is a novel meta-heuristic inspired by the foraging behavior of...
A note on the shortest processing time heuristic for solving scheduling problems with generalized due dates
A note on the shortest processing time heuristic for solving scheduling problems with generalized due dates
2004,
Two NP-hard scheduling problems on parallel identical machines with generalized due...
Cycling in linear programming problems
Cycling in linear programming problems
2004,
We collected and analyzed a number of linear programming problems that have been shown...
Product location, allocation and server home base location for an order picking line with multiple servers
Product location, allocation and server home base location for an order picking line with multiple servers
2004,
In this paper, we are interested in several interrelated control issues for a...
D-ants: savings based ants divide and conquer the vehicle routing problem
D-ants: savings based ants divide and conquer the vehicle routing problem
2004,
This paper presents an algorithm that builds on the Savings based Ant System and...
Capacity expansion of fiber optic networks with wavelength division multiplexing systems: problem formulation and comparative analysis
Capacity expansion of fiber optic networks with wavelength division multiplexing systems: problem formulation and comparative analysis
2004,
In this paper we provide an arc-path formulation for the problem of locating and...
Exact algorithms for unconstrained three-dimensional cutting problems: a comparative study
Exact algorithms for unconstrained three-dimensional cutting problems: a comparative study
2004,
In this paper we propose two exact algorithms for solving the three-dimensional...
Approximate algorithms for constrained circular cutting problems
Approximate algorithms for constrained circular cutting problems
2004,
In this paper, we study the problem of cutting a rectangular plate R of dimensions...
Papers per page: