Journal: Computers and Operations Research

Found 2748 papers in total
The demand partitioning method for reducing aggregation errors in p-median problems
The demand partitioning method for reducing aggregation errors in p-median problems
1999,
The demand partitioning method for reducing aggregation errors in the solution of...
A p-center grid-positioning aggregation procedure
A p-center grid-positioning aggregation procedure
1999,
We present an algorithm for aggregating p -center demand points such that the...
Allocation of discrete demand with changing costs
Allocation of discrete demand with changing costs
1999,
This paper investigates the allocation of discrete demand among facilities by...
The maximum capture problem with heterogeneous customers
The maximum capture problem with heterogeneous customers
1999,
A product is sold in a geographical market and it is provided by different companies....
Economics of location: A selective survey
Economics of location: A selective survey
1999,
We present a selective survey of the main results obtained in spatial economic theory....
Algorithms for path medi-centers of a tree
Algorithms for path medi-centers of a tree
1999,
We consider the problem of finding an optimal location of a path on a tree, using...
The stochastic queue center problem
The stochastic queue center problem
1999,
This paper considers the Stochastic Queue Center problem, which seeks to locate a...
Integrating maintenance and production decisions in a hierarchical production planning environment
Integrating maintenance and production decisions in a hierarchical production planning environment
1999,
This article presents a three-part model to evaluate an organization's maintenance...
Some experiments in Tchebycheff-based approaches for interactive multiple objective decision making
Some experiments in Tchebycheff-based approaches for interactive multiple objective decision making
1999,
Tchebycheff metric based approaches have become popular for sampling the set of...
Analyzing closed Kanban-controlled assembly systems by iterative aggregation–disaggregation
Analyzing closed Kanban-controlled assembly systems by iterative aggregation–disaggregation
1999,
In recent years, many companies have begun using work-in-process (WIP)-limiting...
Expansion method for the throughput analysis of open finite manufacturing/queueing networks with N-policy
Expansion method for the throughput analysis of open finite manufacturing/queueing networks with N-policy
1999,
In this paper we consider arbitrary topology manufacturing (queueing) systems with...
An efficient evolutionary programming algorithm
An efficient evolutionary programming algorithm
1999,
A novel evolutionary programming algorithm, which not only has a rapid convergence...
Intensification and diversification with elite tabu search solutions for the linear ordering problem
Intensification and diversification with elite tabu search solutions for the linear ordering problem
1999,
In this paper, we develop a new heuristic procedure for the linear ordering problem...
A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
1999,
This paper addresses the problem of scheduling a given set of independent jobs on a...
The strong NP-hardness of two-stage flowshop scheduling with a common second-stage machine
The strong NP-hardness of two-stage flowshop scheduling with a common second-stage machine
1999,
The problem of interest is to schedule two types of jobs on a two-stage flowshop with...
One-operator–two-machine flowshop scheduling with setup and dismounting times
One-operator–two-machine flowshop scheduling with setup and dismounting times
1999,
In this paper we study the problem of scheduling n jobs in a...
The time dependent machine makespan problem is strongly NP-complete
The time dependent machine makespan problem is strongly NP-complete
1999,
The computational complexity of the problem of scheduling a set of start-time...
Parallel machine scheduling with earliness and tardiness penalties
Parallel machine scheduling with earliness and tardiness penalties
1999,
In the parallel machine scheduling problem with earliness and tardiness penalties...
A genetic algorithm for multi-level, multi-machine lot sizing and scheduling
A genetic algorithm for multi-level, multi-machine lot sizing and scheduling
1999,
This contribution introduces a mixed-integer programming formulation for the...
A new branch-and-bound approach for the n/2/flowshop/αF + βCmax flowshop scheduling problem
A new branch-and-bound approach for the n/2/flowshop/αF + βCmax flowshop scheduling problem
1999,
In this study, a special situation involving a computationally difficult flowshop...
On censored Markov chains, best augmentations and aggregation/disaggregation procedures
On censored Markov chains, best augmentations and aggregation/disaggregation procedures
1999,
Consider the stationary distribution of a Markov chain censored to a subset of the...
Exponential neighbourhood local search for the traveling salesman problem
Exponential neighbourhood local search for the traveling salesman problem
1999,
We analyse an approach to the TSP, introduced by Punnen, which is a generalization of...
Small diameter neighbourhood graphs for the traveling salesman problem: At most four moves from tour to tour
Small diameter neighbourhood graphs for the traveling salesman problem: At most four moves from tour to tour
1999,
A neighbourhood N ( T ) of a tour T (in the travelling salesman problem (TSP) with n...
Gilmore–Gomory type traveling salesman problems
Gilmore–Gomory type traveling salesman problems
1999,
One of the well-known, solvable cases of the traveling salesman problem (TSP) is the...
Papers per page: