Journal: Operations Research Letters

Found 1763 papers in total
Scheduling on uniform parallel machines to minimize maximum lateness
Scheduling on uniform parallel machines to minimize maximum lateness
2000,
We consider the uniform parallel machine scheduling problem with the objective of...
Group technology approach to the open shop scheduling problem with batch setup times
Group technology approach to the open shop scheduling problem with batch setup times
2000,
This paper studies the problem of scheduling jobs in a two-machine open shop to...
An improved heuristic for two-machine flowshop scheduling with an availability constraint
An improved heuristic for two-machine flowshop scheduling with an availability constraint
2000,
In this paper we study the two-machine flowshop scheduling problem with an...
An optimal rounding gives a better approximation for scheduling unrelated machines
An optimal rounding gives a better approximation for scheduling unrelated machines
2005,
A polynomial-time algorithm is suggested for non-preemptive scheduling of n...
Optimal preemptive scheduling on a fixed number of identical parallel machines
Optimal preemptive scheduling on a fixed number of identical parallel machines
2005,
In this paper, we consider the preemptive scheduling problem on a fixed number of...
The complexity of machine scheduling for stability with a single disrupted job
The complexity of machine scheduling for stability with a single disrupted job
2005,
A stable schedule is a robust schedule that will change little when uncertain events...
Minimizing makespan on a single batching machine with release times and non-identical job sizes
Minimizing makespan on a single batching machine with release times and non-identical job sizes
2005,
We consider the problem of scheduling jobs with release times and non-identical job...
Capacity competition of make-to-order firms
Capacity competition of make-to-order firms
2005,
Two make-to-order firms, each modelled as a single-server queue, compete for a common...
Inverse conic programming with applications
Inverse conic programming with applications
2005,
Linear programming duality yields efficient algorithms for solving inverse linear...
On complexity of unconstrained hyperbolic 0–1 programming problems
On complexity of unconstrained hyperbolic 0–1 programming problems
2005,
Single- and multiple-ratio unconstrained hyperbolic 0–1 programming problems are...
Optimization with additional variables and constraints
Optimization with additional variables and constraints
2005,
Norton, Plotkin and Tardos proved that, loosely spoken, an LP problem is solvable in...
Level-crossing approach to a time-limited service system with two types of vacations
Level-crossing approach to a time-limited service system with two types of vacations
2005,
We consider an M X /G/ 1 queue with nonpreemptive time-limited service and timer and...
When does the cμ rule apply to finite-population queueing systems?
When does the cμ rule apply to finite-population queueing systems?
2005,
We consider optimal scheduling of the server in a finite-population queueing system...
The maximum saving partition problem
The maximum saving partition problem
2005,
The input to the maximum saving partition problem consists of a set...
Approximation of the supply scheduling problem
Approximation of the supply scheduling problem
2005,
The supply scheduling problem consists in finding a minimum cost delivery plan from a...
Two-machine flow shop scheduling problems with no-wait jobs
Two-machine flow shop scheduling problems with no-wait jobs
2005,
In this paper we provide a fairly complete complexity classification of various...
The m-machine flowshop problem with unit-time operations and intree precedence constraints
The m-machine flowshop problem with unit-time operations and intree precedence constraints
2005,
We consider the flowshop problem with unit-time operations and intree precedence...
Minimizing flow time on a constant number of machines with preemption
Minimizing flow time on a constant number of machines with preemption
2005,
We consider offline algorithms for minimizing the total flow time on O(1) machines...
A polynomial algorithm for no-wait cyclic hoist scheduling in an extended electroplating line
A polynomial algorithm for no-wait cyclic hoist scheduling in an extended electroplating line
2005,
This paper addresses cyclic hoist scheduling in a no-wait electroplating line where a...
Delayed demand information and dampened bullwhip effect
Delayed demand information and dampened bullwhip effect
2005,
This paper considers an inventory setting in which the historical data used for demand...
An algorithm for source location in directed graphs
An algorithm for source location in directed graphs
2005,
A polynomial time solution algorithm is described to find a smallest subset R of nodes...
Distribution center consolidation games
Distribution center consolidation games
2005,
We study a location-inventory model to analyze the impact of consolidation of...
Inapproximability results for no-wait job shop scheduling
Inapproximability results for no-wait job shop scheduling
2004,
We investigate the approximability of the no-wait job shop scheduling problem under...
On the complexity of the car sequencing problem
On the complexity of the car sequencing problem
2004,
In this note we give an easier proof of the known result that the car sequencing...
Papers per page: