Journal: Computers and Operations Research

Found 2748 papers in total
Robust separation of finite sets via quadratics
Robust separation of finite sets via quadratics
2001,
Given a pair of finite disjoint sets A and B in R n , a fundamental problem with many...
Shape-preserving computation in economic growth models
Shape-preserving computation in economic growth models
2001,
We point out the shape characteristics – monotonicity and concavity – of...
A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands
A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands
2001,
We formulate a multiple-depot, multiple-vehicle, location-routing problem with...
An enhanced rostering model for airline crews
An enhanced rostering model for airline crews
2001,
This paper introduces an efficient adaptation of the branch-and-bound technique that...
A newsboy problem with reactive production
A newsboy problem with reactive production
2001,
This paper extends the classic newsboy problem by introducing reactive production....
The distributed program reliability analysis on ring-type topologies
The distributed program reliability analysis on ring-type topologies
2001,
Distributed computing system (DCS) has become very popular for its high...
Higher-order derivatives in linear and quadratic programming
Higher-order derivatives in linear and quadratic programming
2001,
An interior method for linear and quadratic programming which makes use of higher...
A new heuristic and dominance relations for no-wait flowshops with setups
A new heuristic and dominance relations for no-wait flowshops with setups
2001,
The two-machine no-wait flowshop problem, where setup times are considered separate...
An effective hybrid optimization strategy for job-shop scheduling problems
An effective hybrid optimization strategy for job-shop scheduling problems
2001,
Simulated annealing is a naturally serial algorithm, but its behavior can be...
Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
2001,
We consider a scheduling problem where a set of jobs are simultaneously available for...
Single machine weighted earliness–tardiness penalty problem with a common due date
Single machine weighted earliness–tardiness penalty problem with a common due date
2001,
In this paper, we have considered a class of single machine job scheduling problems...
Minimizing makespan subject to minimum flowtime on two identical parallel machines
Minimizing makespan subject to minimum flowtime on two identical parallel machines
2001,
We consider the problem of scheduling jobs on two parallel identical machines where an...
On the first-order estimation of multipliers from Kuhn–Tucker systems
On the first-order estimation of multipliers from Kuhn–Tucker systems
2001,
The minimization of a nonlinear function with linear and nonlinear constraints and...
The three-stage assembly flowshop scheduling problem
The three-stage assembly flowshop scheduling problem
2001,
We consider the three-stage assembly flowshop scheduling problem with the objective of...
On computing the distribution function of the sum of independent random variables
On computing the distribution function of the sum of independent random variables
2001,
We present an efficient approach to the determination of the convolution of random...
A simulation study of artificial neural networks for nonlinear time-series forecasting
A simulation study of artificial neural networks for nonlinear time-series forecasting
2001,
This study presents an experimental evaluation of neural networks for nonlinear...
A class of bottleneck expansion problems
A class of bottleneck expansion problems
2001,
In this paper we consider how to increase the capacities of the elements in a set E...
An approximation of the activity duration distribution in PERT
An approximation of the activity duration distribution in PERT
2001,
PERT is widely used as a tool for managing large-scale projects. The traditional PERT...
Comparing descent heuristics and metaheuristics for the vehicle routing problem
Comparing descent heuristics and metaheuristics for the vehicle routing problem
2001,
Three improvement heuristics for the vehicle routing problem are considered: a descent...
Optimal prioritized channel allocation in cellular mobile systems
Optimal prioritized channel allocation in cellular mobile systems
2001,
Under the cutoff priority discipline, the optimal prioritized channel allocation...
The irregular cutting-stock problem – a new procedure for deriving the no-fit polygon
The irregular cutting-stock problem – a new procedure for deriving the no-fit polygon
2001,
The nofit polygon is a powerful and effective tool for handling the geometry required...
A utility range-based interactive group support system for multiattribute decision making
A utility range-based interactive group support system for multiattribute decision making
2001,
This research suggests an interactive procedure for solving a multiattribute group...
The expected utility theory applied to an industrial decision problem – what technological alternative to implement to treat industrial solid residuals
The expected utility theory applied to an industrial decision problem – what technological alternative to implement to treat industrial solid residuals
2001,
This paper presents a method developed to solve industrial decision problems based on...
Optimal control of service for facilities holding inventory
Optimal control of service for facilities holding inventory
2001,
This paper addresses the problem of optimally controlling service rates for an...
Papers per page: