Romeijn H. Edwin

H. Edwin Romeijn

Information about the author H. Edwin Romeijn will soon be added to the site.
Found 24 papers in total
Capacitated production and subcontracting in a serial supply chain
2007
This paper extends a series of recent results regarding the polynomial solvability of...
Allocating procurement to capacitated suppliers with concave quantity discounts
2008
We consider a procurement problem where suppliers offer concave quantity discounts....
Designing two-echelon supply networks
2007
A modern distribution network design model needs to deal with the trade-offs between a...
Lot-sizing with non-stationary cumulative capacities
2007
We study a new class of capacitated economic lot-sizing problems. We show that the...
On a nonseparable convex maximization problem with continuous knapsack constraints
2007
We develop a polynomial-time algorithm for a class of nonseparable convex maximization...
Integrated capacity, demand, and production planning with subcontracting and overtime options
2007
Models for integrated production and demand planning decisions can serve to improve a...
Requirements planning with pricing and order selection flexibility
2006
Past requirements-planning research has typically assumed that the firm's demands are...
A new linear programming approach to radiation therapy treatment planning problems
2006
We consider the problem of radiation therapy treatment planning for cancer patients....
Integrated lot sizing in serial supply chains with production capacities
2005
We consider a model for a serial supply chain in which production, inventory, and...
A branch-and-price algorithm for the multiperiod single-sourcing problem
2003
In this paper, we propose a multiperiod single-sourcing problem (MPSSP), which takes...
Generation of classes of robust periodic railway timetables
2006
In this paper we discuss the problem of randomly sampling classes of fixed-interval...
Cross-facility management of production and transportation planning problem
2006
This paper studies an integrated production and transportation planning problem in a...
Manufacturing delivery performance for supply chain management
2007
This paper considers single-stage make-to-order production systems. We focus on (1)...
The continuous-time single-sourcing problem with capacity expansion opportunities
2005
This paper develops a new model for allocating demand from retailers (or customers) to...
An integrated inventory-routing system for multi-item joint replenishment with limited vehicle capacity
2005
In this paper, we develop a mathematical programming approach for coordinating...
Economic ordering decisions with market choice flexibility
2004
Standard approaches to classical inventory control problems treat satisfying a...
Asymptotic analysis of a greedy heuristic for the multi-period single-sourcing problem: the acyclic case
2004
The multi-period single-sourcing problem that we address in this paper can be used as...
Generating experimental data for the generalized assignment problem
2001
The Generalized Assignment Problem (GAP) is the problem of finding the minimal cost...
Parallel algorithms for solving aggregated shortest-path problems
1999
We consider the problem of computing in parallel all pairs of shortest paths in a...
Approximating shortest paths in large-scale networks with an application to intelligent transportation systems
1998
We propose a hierarchical algorithm for approximating shortest paths between all pairs...
Routing trains through railway stations: Complexity issues
1997
In this paper we consider the problem of routing trains through railway stations. This...
Routing trains through railway stations: Model formulation and algorithms
1996
In this paper the authors consider the problem of routing trains through railway...
Parallel machine scheduling: A probabilistic analysis
1996
The minimum makespan of the general parallel machine scheduling problem with m...
Duality in infinite dimensional linear programming
1992
The authors consider the class of linear programs with infinitely many variables and...
Papers per page: