Country: United States

Found 17049 papers in total
Online searching
Online searching
2001,
We consider the problem of searching m branches which, with the exception of a common...
Scheduling of Resource-Constrained Projects
Scheduling of Resource-Constrained Projects
2001,
Scheduling batches with sequential job processing for two-machine flow and open shops
Scheduling batches with sequential job processing for two-machine flow and open shops
2001,
In this paper, we study a problem of scheduling and batching on two machines in a...
A computationally efficient method for nonlinear multicommodity network flow problems
A computationally efficient method for nonlinear multicommodity network flow problems
1997,
In this paper, we present a new method for solving nonlinear multicommodity network...
Non-approximability results for scheduling problems with minsum criteria
Non-approximability results for scheduling problems with minsum criteria
2001,
We provide several non-approximability results for deterministic scheduling problems...
Commodity family extended formulations of uncapacitated fixed charge network flow problems
Commodity family extended formulations of uncapacitated fixed charge network flow problems
1997,
Uncapacitated fixed charge network flow problems are single-commodity flow problems...
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...
State space partitioning methods for stochastic shortest path problems
State space partitioning methods for stochastic shortest path problems
1997,
This paper describes methods for computing measures related to shortest paths in...
Minimizing makespan on a single batch processing machine with nonidentical job sizes
Minimizing makespan on a single batch processing machine with nonidentical job sizes
2001,
We deal with the problem of minimizing makespan on a single batch processing machine....
On-line algorithms for minimizing makespan on batch processing machines
On-line algorithms for minimizing makespan on batch processing machines
2001,
We consider the problem of scheduling jobs on-line on batch processing machines with...
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...
Multiple common due dates
Multiple common due dates
2001,
Common due date problems have been extensively discussed in the scheduling literature....
A branch and bound algorithm for the minimum storage-time sequencing problem
A branch and bound algorithm for the minimum storage-time sequencing problem
2001,
The minimum storage-time sequencing problem generalizes many well-known problems in...
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...
Heuristics for the multi-resource generalized assignment problem
Heuristics for the multi-resource generalized assignment problem
2001,
The well-known generalized assignment problem (GAP) involves the identification of a...
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...
Papers per page: