Journal: Operations Research

Found 2096 papers in total
Multistage lot sizing problems via randomized rounding
Multistage lot sizing problems via randomized rounding
2001,
We study the classical multistage lot sizing problem that arises in distribution and...
Research strategies used by OR/MS workers: Extension of the analysis of US flagship journals to the United Kingdom
Research strategies used by OR/MS workers: Extension of the analysis of US flagship journals to the United Kingdom
2000,
Reisman and Kirschnick have defined seven process categories among OR/MS research...
A class of label-correcting methods for the K shortest paths problem
A class of label-correcting methods for the K shortest paths problem
2001,
In this paper we deal with the problem of finding the first K shortest paths from a...
Online searching
Online searching
2001,
We consider the problem of searching m branches which, with the exception of a common...
Performance analysis and best implementations of old and new algorithms for the open-pit mining problem
Performance analysis and best implementations of old and new algorithms for the open-pit mining problem
2000,
The open-pit mining problem is to determine the contours of a mine, based on economic...
Optimal guaranteed return portfolios and the casino effect
Optimal guaranteed return portfolios and the casino effect
2000,
In this paper we address the problem of determining optimal portfolios that may...
On the asymptotic optimality of the shortest processing time rule for the flow shop average completion time problem
On the asymptotic optimality of the shortest processing time rule for the flow shop average completion time problem
2000,
Consider a flowshop with M machines in series, through which a set of jobs are to be...
High multiplicity in earliness–tardiness scheduling
High multiplicity in earliness–tardiness scheduling
2000,
When a production shop has a large number of identical parts, the parts are often...
Dynamic scheduling in a make-to-stock system: A partial characterization of optimal policies
Dynamic scheduling in a make-to-stock system: A partial characterization of optimal policies
2000,
We consider the problem of dynamically allocating production capacity between two...
Scheduling with fixed delivery dates
Scheduling with fixed delivery dates
2001,
In most classical scheduling models, it is assumed that a job is dispatched to a...
Heavy traffic analysis of dynamic cyclic policies: A unified treatment of the single machine scheduling problem
Heavy traffic analysis of dynamic cyclic policies: A unified treatment of the single machine scheduling problem
2001,
This paper examines how setups, due dates, and the mix of standardized and customized...
Simultaneous assignment of locomotives and cars to passenger trains
Simultaneous assignment of locomotives and cars to passenger trains
2001,
The problem of assigning locomotives and cars to trains is a complex task for most...
The dynamic and stochastic knapsack problem with random sized items
The dynamic and stochastic knapsack problem with random sized items
2001,
A resource allocation problem, called the dynamic and stochastic knapsack problem...
Scheduling with opting out: Improving upon random priority
Scheduling with opting out: Improving upon random priority
2001,
In a scheduling problem where agents can opt out, we show that the familiar random...
Dynamic economic lot size models with period-pair-dependent backorders and inventory costs
Dynamic economic lot size models with period-pair-dependent backorders and inventory costs
2001,
Inventory and backorder cost functions in the classical Wagner–Whitin economic...
Optimal dynamic allocation of treatment and enforcement in illicit drug control
Optimal dynamic allocation of treatment and enforcement in illicit drug control
2001,
There has been considerable debate about what share of drug control resources should...
Improved dynamic programming methods for optimal control of lumped-parameter stochastic systems
Improved dynamic programming methods for optimal control of lumped-parameter stochastic systems
2001,
New dynamic programming methods are developed to solve stochastic control problems...
Combining minsum and minmax: A goal programming approach
Combining minsum and minmax: A goal programming approach
2001,
A number of methods for multiple-objective optimization problems (MOP) give as...
Improving the stationary independent period by period approach for staffing service systems that have cyclic demands
Improving the stationary independent period by period approach for staffing service systems that have cyclic demands
2001,
This paper evaluates the practice of determining staffing requirements in service...
A note on coefficient adjustment using SOS constraints
A note on coefficient adjustment using SOS constraints
2001,
We examine two coefficient adjustment methods proposed in the literature, and we show...
Aggregation and mixed integer rounding to solve mixed integer programs
Aggregation and mixed integer rounding to solve mixed integer programs
2001,
In this paper, we discuss the use of mixed integer rounding (MIR) inequalities to...
A comparison of formulations for the single-airport ground-holding problem with banking constraints
A comparison of formulations for the single-airport ground-holding problem with banking constraints
2000,
Both the single-airport ground-holding problem (GH) and the multi-airport...
Inference-based sensitivity analysis for mixed integer/linear programming
Inference-based sensitivity analysis for mixed integer/linear programming
2000,
A new method of sensitivity analysis for mixed integer/linear programming (MILP) is...
A relational modeling system for linear and integer programming
A relational modeling system for linear and integer programming
2000,
We discuss an integer linear programming modeling system based on relational algebra....
Papers per page: