Journal: European Journal of Operational Research

Found 7937 papers in total
Finite buffer polling models with routing
2005,
This paper analyzes a finite buffer polling system with routing. Finite buffers are...
Partial convexification cuts for 0–1 mixed-integer programs
2005,
In this research, we propose a new cut generation scheme based on constructing a...
Static hedging of multivariate derivatives by simulation
2005,
We propose an approximate static hedging procedure for multivariate derivatives. The...
Maximization of solution flexibility for robust shop scheduling
2005,
We consider the problem of introducing flexibility in the schedule determination phase...
Complexity results for flow-shop problems with a single server
2005,
Flow-shop problems with a single server are generalizations of classical flow-shop...
The two-machine flow-shop problem with weighted late work criterion and common due date
2005,
The paper is on the two-machine non-preemptive flow-shop scheduling problem with a...
Positive half-products and scheduling with controllable processing times
2005,
We study the single machine scheduling problem with controllable job processing times...
Single machine scheduling to minimize total weighted tardiness
2005,
The problem of minimizing the total weighted tardiness in single machine scheduling is...
Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem
2005,
In this paper we study both the non-preemptive and preemptive versions of the popular...
Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach
2005,
This paper considers the problem of scheduling jobs on unrelated parallel machines to...
Scheduling unit execution time and unit communication delay outforests to minimize maximum lateness
2005,
In this paper, a well known NP -hard problem with parallel processors, precedence...
A comprehensive review and evaluation of permutation flowshop heuristics
2005,
In this work we present a review and comparative evaluation of heuristics and...
Scheduling of continuous and discontinuous material flows with intermediate storage restrictions
2005,
This paper deals with scheduling batch (i.e., discontinuous), continuous, and...
Continuous filling and emptying of storage systems in constraint-based scheduling
2005,
In constraint-based scheduling, storage systems are modeled by a class of resources...
A heuristic to schedule flexible job-shop in a glass factory
2005,
We describe the design and implementation of a scheduling system in a glass factory....
A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem
2005,
An O( n 2 ) algorithm is presented for the n jobs m parallel machines problem with...
Vehicle minimization for periodic deliveries
2005,
We consider the problem of minimizing the number of vehicles required to make strictly...
On the single machine total tardiness problem
2005,
In this paper we study the single machine total tardiness problem. We first identify...
A 6/5-approximation algorithm for the two-machine routing open-shop problem on a two-node network
2005,
In the routing open-shop problem, jobs are located at nodes of a transportation...
A clustering algorithm for item assignment in a synchronized zone order picking system
2005,
In a synchronized zone order picking system, all the zones process the same order...
A heuristic algorithm for the truckload and less-than-truckload problem
2005,
The delivery of goods from a warehouse to local customers is an important and...
A multicriteria decision making model for media selection in the dual consumer/industrial market
2005,
An optimal advertising media selection is a strategic factor for the operations of...
Advertising in a dynamic spatial monopoly
2005,
This paper characterises the dynamics of advertising investment in a spatial monopoly,...
Crop succession requirements in agricultural production planning
2005,
A method is proposed to write crop succession requirements as linear constraints in an...
Papers per page: