Journal: Computers and Operations Research

Found 2748 papers in total
Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines
Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines
2005,
This article addresses a multi-stage flow shop scheduling problem with unrelated...
Some local search algorithms for no-wait flow-shop problem with makespan criterion
Some local search algorithms for no-wait flow-shop problem with makespan criterion
2005,
This paper develops and compares different local search algorithms for the no-wait...
Enhancing router QoS through job scheduling with weighted shortest processing time–adjusted
Enhancing router QoS through job scheduling with weighted shortest processing time–adjusted
2005,
Most routers on the Internet employ a first-in-first-out (FIFO) scheduling rule to...
An algorithm for insertion of idle time in the single-machine scheduling problem with convex cost functions
An algorithm for insertion of idle time in the single-machine scheduling problem with convex cost functions
2005,
This paper addresses the problem of optimally inserting idle time into a...
Heuristic methods for the identical parallel machine flowtime problem with set-up times
Heuristic methods for the identical parallel machine flowtime problem with set-up times
2005,
We consider the scheduling of N jobs divided into G families for processing on M...
Maximizing service of carousel storage
Maximizing service of carousel storage
2005,
Jacobs et al . considered the problem on maximizing service of carousel storage and...
Travel time analysis of a new automated storage and retrieval system
Travel time analysis of a new automated storage and retrieval system
2005,
In conventional automated storage and retrieval systems (AS/RS), stacker cranes are...
A two-dimensional vector packing model for the efficient use of coil cassettes
A two-dimensional vector packing model for the efficient use of coil cassettes
2005,
We consider the problem of efficiently packing steel products, known as coils, into...
Improved algorithm for maximizing service of carousel storage
Improved algorithm for maximizing service of carousel storage
2005,
We consider a problem of maximizing the service of a carousel storage system from...
Reformulation descent applied to circle packing problems
Reformulation descent applied to circle packing problems
2005,
Several years ago classical Euclidean geometry problems of densest packing of circles...
Quantity flexibility contracts under Bayesian updating
Quantity flexibility contracts under Bayesian updating
2005,
In this paper, we consider a decentralized supply chain consisting of two independent...
Very large-scale vehicle routing: new test problems, algorithms, and results
Very large-scale vehicle routing: new test problems, algorithms, and results
2005,
The standard vehicle routing problem was introduced in the OR/MS literature about 45...
A tabu search heuristic for the team orienteering problem
A tabu search heuristic for the team orienteering problem
2005,
This paper describes a tabu search heuristic for the Team Orienteeering Problem (TOP)....
Active guided evolution strategies for large-scale vehicle routing problems with time windows
Active guided evolution strategies for large-scale vehicle routing problems with time windows
2005,
We present a new and effective metaheuristic algorithm, active guided evolution...
A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
2005,
This paper presents a parallel cooperative multi-search method for the vehicle routing...
Solving the vehicle routing problem with adaptive memory programming methodology
Solving the vehicle routing problem with adaptive memory programming methodology
2005,
In this paper we develop an adaptive memory programming method for solving the...
A subrating channel assignment scheme for cellular radio network with directed retry
A subrating channel assignment scheme for cellular radio network with directed retry
2005,
In this paper the subrating channel assignment scheme is used to improve the...
A cutting stock problem and its solution in the manufacturing industry of large electric generators
A cutting stock problem and its solution in the manufacturing industry of large electric generators
2005,
T-shape cutting patterns are applied in the manufacturing of circular and sectorial...
A combined approach to the solution to the general one-dimensional cutting stock problem
A combined approach to the solution to the general one-dimensional cutting stock problem
2005,
In this article a combined method for the solution to the general one-dimensional...
An improved initial basis for the Simplex algorithm
An improved initial basis for the Simplex algorithm
2005,
A lot of research has been done to find a faster (polynomial) algorithm that can solve...
Three new metrics to measure the convergence of metaheuristics towards the Pareto frontier and the aesthetic of a set of solutions in biobjective optimization
Three new metrics to measure the convergence of metaheuristics towards the Pareto frontier and the aesthetic of a set of solutions in biobjective optimization
2005,
In this paper, some new quality metrics concerning the evaluation of performance of...
Delaunay partitions in Rn applied to non-convex programs and vertex/facet enumeration problems
Delaunay partitions in Rn applied to non-convex programs and vertex/facet enumeration problems
2005,
Using a pair of theorems linking Delaunay partitions and linear programming, we...
Determination of the candidate arc set for the asymmetric traveling salesman problem
Determination of the candidate arc set for the asymmetric traveling salesman problem
2005,
As size of the traveling salesman problem (TSP) increases, it is unreasonable to find...
Analytic and numerical aspects of batch service queues with single vacation
Analytic and numerical aspects of batch service queues with single vacation
2005,
This paper deals with an M/G/1 batch service queue where customers are served in...
Papers per page: