Journal: European Journal of Operational Research

Found 7937 papers in total
A polynomial algorithm for a two-machine no-wait job-shop scheduling problem
A polynomial algorithm for a two-machine no-wait job-shop scheduling problem
1998,
This paper considers the no-wait scheduling of n jobs, where each job is a chain of...
The flow shop with parallel machines: A tabu search approach
The flow shop with parallel machines: A tabu search approach
1998,
A fast and easily implementable approximation algorithm for the problem of finding a...
Performance enhancements to tabu search for the early/tardy scheduling problem
Performance enhancements to tabu search for the early/tardy scheduling problem
1998,
Tabu search (TS) has been used to solve a number of NP-hard problems including the...
A tabu seach approach to machine scheduling
A tabu seach approach to machine scheduling
1998,
In this paper we apply the tabu search (TS) technique to a complex machine scheduling...
Nurse scheduling with tabu search and strategic oscillation
Nurse scheduling with tabu search and strategic oscillation
1998,
The problem of producing rosters for nursing staff in a large general hospital is...
The Hot Strip Mill Production Scheduling Problem: A Tabu Search approach
The Hot Strip Mill Production Scheduling Problem: A Tabu Search approach
1998,
The Hot Strip Mill Production Scheduling Problem is a hard problem that arises in the...
Multi-resource shop scheduling with resource flexibility
Multi-resource shop scheduling with resource flexibility
1998,
The shop scheduling problem tackled in this paper integrates many features that can be...
Classical and new heuristics for the open-shop problem: A computational evaluation
Classical and new heuristics for the open-shop problem: A computational evaluation
1998,
We study the problem of constructing minimum makespan schedules for the Open-Shop...
Minimization of the makespan in a two-machine problem under given resource constraints
Minimization of the makespan in a two-machine problem under given resource constraints
1998,
In this paper the classical two-machine flow-shop problem was generalized to the case...
On a methodology for discrete-continuous scheduling
On a methodology for discrete-continuous scheduling
1998,
Discrete continuous problems of scheduling nonpreemptable jobs on parallel machines...
Local search metaheuristics for discrete continuous scheduling problems
Local search metaheuristics for discrete continuous scheduling problems
1998,
Problems of scheduling nonpreemptable jobs which require simultaneously a machine from...
Two-machine shop scheduling with zero and unit processing times
Two-machine shop scheduling with zero and unit processing times
1998,
We consider the two machine flow shop and open shop problems to minimize the weighted...
Branch and bound crossed with GA to solve hybrid flowshops
Branch and bound crossed with GA to solve hybrid flowshops
1998,
This article deals with an optimal method for solving a k -stage hybrid flowshop...
Distributed scheduling using simple learning machines
Distributed scheduling using simple learning machines
1998,
A new approach to develop parallel and distributed algorithms of scheduling tasks in...
A bicriteria two-machine permutation flowshop problem
A bicriteria two-machine permutation flowshop problem
1998,
The problem attacked in this paper is the scheduling of n jobs on two machines which...
A model for warehouse order picking
A model for warehouse order picking
1998,
Order picking in conventional warehouse environments involves determining a sequence...
Optimal product and server locations in one-dimensional storage racks
Optimal product and server locations in one-dimensional storage racks
1998,
This paper treats several problems of product storage and server locations in...
The greater whole: Towards a synthesis of system dynamics and soft systems methodology
The greater whole: Towards a synthesis of system dynamics and soft systems methodology
1998,
This paper makes a theoretical case for using these two systems approaches together....
The rural postman problem with deadline classes
The rural postman problem with deadline classes
1998,
Vehicle routing problems with general time windows are extremely difficult to solve....
Separating capacity constraints in the CVRP using tabu search
Separating capacity constraints in the CVRP using tabu search
1998,
Branch and Cut methods have shown to be very successful in the resolution of some hard...
Minimizing the number of vehicles in periodic scheduling: The non-Euclidean case
Minimizing the number of vehicles in periodic scheduling: The non-Euclidean case
1998,
In this paper we consider the problem of minimizing the number of vehicles needed to...
Optimal television schedules in alternative competitive environments
Optimal television schedules in alternative competitive environments
1998,
We formulate network-television-scheduling problems as integer programs for three...
An MCDM approach to production analysis: An application irrigated farms in Southern Spain
An MCDM approach to production analysis: An application irrigated farms in Southern Spain
1998,
The analysis of the decision-making process in agricultural enterprises is approached...
Design of a distributed fiber transport network with hubbing topology
Design of a distributed fiber transport network with hubbing topology
1998,
This paper deals with the comprehensive design of a distributed network, whose...
Papers per page: