Country: United Kingdom

Found 17295 papers in total
An interactive heuristic method for multi-objective combinatorial optimization
An interactive heuristic method for multi-objective combinatorial optimization
2000,
We have previously developed an adaptation of the simulated annealing for...
A flexible multicomputer algorithm for elementary matrix operations
A flexible multicomputer algorithm for elementary matrix operations
2000,
In the present study we introduce and test a new flexible multicomputer (FM) algorithm...
An extended scheduling model for producing corrugated boxes
An extended scheduling model for producing corrugated boxes
2000,
Today, custom and shipping regulations recognize the importance of lightweight and...
The choice of dispatching rules in a shop using internally set due-dates with quoted leadtime and tardiness costs
The choice of dispatching rules in a shop using internally set due-dates with quoted leadtime and tardiness costs
2000,
Setting due-dates poses a dilemma for the manufacturing manager. If the due-dates...
Solution of the single machine total tardiness problem
Solution of the single machine total tardiness problem
1999,
The paper deals with the solution of the single machine total tardiness model. It...
A min-sum 3/2-approximation algorithm for scheduling unrelated parallel machines
A min-sum 3/2-approximation algorithm for scheduling unrelated parallel machines
1999,
We consider the problem of minimizing the sum of weighted completion times of jobs...
The impact of approximate evaluation on the performance of search algorithms for warehouse scheduling
The impact of approximate evaluation on the performance of search algorithms for warehouse scheduling
1999,
The Coors warehouse scheduling problem involves finding a permutation of customer...
Minimizing makespan in a pallet-constrained flowshop
Minimizing makespan in a pallet-constrained flowshop
1999,
We consider the problem of scheduling n jobs in a pallet-constrained flowshop so as to...
Multistage hybrid flowshop scheduling with identical jobs and uniform parallel machines
Multistage hybrid flowshop scheduling with identical jobs and uniform parallel machines
1999,
The single-stage scheduling problem to minimize the makespan of identical jobs with...
A label correcting approach for solving bicriterion shortest-path problems
A label correcting approach for solving bicriterion shortest-path problems
2000,
This article contributes with a very fast algorithm for solving the bicriterion...
A new tabu search procedure for an audit-scheduling problem
A new tabu search procedure for an audit-scheduling problem
1999,
We consider the following version of the auditing problem. A set of jobs must be...
A hybrid genetic/optimization algorithm for a task allocation problem
A hybrid genetic/optimization algorithm for a task allocation problem
1999,
We consider the problem of designing a distributed computing system for handling a set...
Polynomial time approximation algorithms for machine scheduling: Ten open problems
Polynomial time approximation algorithms for machine scheduling: Ten open problems
1999,
We discuss what we consider to be the 10 most vexing open questions in the area of...
Shortest paths in traffic-light networks
Shortest paths in traffic-light networks
2000,
The time-constrained shortest path problem is an important generalization of the...
On the approximability of an interval scheduling problem
On the approximability of an interval scheduling problem
1999,
In this paper we consider a general interval scheduling problem. The problem is a...
Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
1999,
We study the problem of minimizing the weighted number of late jobs to be scheduled on...
Proportionate flow shop with controllable processing times
Proportionate flow shop with controllable processing times
1999,
This paper considers a special class of flow-shop problems, known as the proportionate...
Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches
Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches
2000,
Unlike its cousin, the Euclidean Traveling Salesman Problem (TSP), to the best of our...
Approximability of scheduling with fixed jobs
Approximability of scheduling with fixed jobs
1999,
Scheduling problems of minimizing the makespan on identical parallel machines are...
Interactive multiobjective optimization system WWW-NIMBUS on the Internet
Interactive multiobjective optimization system WWW-NIMBUS on the Internet
2000,
NIMBUS is a multiobjective optimization method capable of solving nondifferentiable...
Optimization Methods for Logical Inference
Optimization Methods for Logical Inference
2000,
Decision-variable partitioning: An alternative modelling approach in soft systems methodology
Decision-variable partitioning: An alternative modelling approach in soft systems methodology
1999,
Creating human activity system models is an essential feature of Soft Systems...
Single-vehicle scheduling with time window constraints
Single-vehicle scheduling with time window constraints
1999,
In the single-vehicle scheduling problem with time window constraints, a vehicle has...
Incorporating uncertainty in competitive bidding
Incorporating uncertainty in competitive bidding
2000,
This paper describes a simple, transparent approach for developing competitive bids,...
Papers per page: