Hoesel C.P.M. van

C.P.M. van Hoesel

Information about the author C.P.M. van Hoesel will soon be added to the site.
Found 7 papers in total
Fully polynomial approximation schemes for single-item capacitated economic lot-sizing problems
Fully polynomial approximation schemes for single-item capacitated economic lot-sizing problems
2001
NP-hard cases of the single-item capacitated lot-sizing problem have been the topic of...
Lifting valid inequalities for the precedence constrained knapsack problem
Lifting valid inequalities for the precedence constrained knapsack problem
1999
This paper considers the precedence constrained knapsack problem. More specifically,...
A polyhedral approach to single-machine scheduling problems
A polyhedral approach to single-machine scheduling problems
1999
We report new results for a time-indexed formulation of nonpreemptive single-machine...
An O(n log n) algorithm for the two-machine flow shop problem with controllable machine speeds
An O(n log n) algorithm for the two-machine flow shop problem with controllable machine speeds
1996
In this paper we consider the two-machine flow shop problem with varying machine...
On the discrete lot-sizing and scheduling problem with Wagner–Whitin costs
On the discrete lot-sizing and scheduling problem with Wagner–Whitin costs
1997
We consider the single-item discrete lot-sizing and scheduling problem. We present a...
An O(nlogn) algorithm for the two-machine flow shop problem with controllable machine speeds
An O(nlogn) algorithm for the two-machine flow shop problem with controllable machine speeds
1996
In this paper the authors consider the two-machine flow shop problem with varying...
An O(T3) algorithm for the economic lot-sizing problem with constant capabilities
An O(T3) algorithm for the economic lot-sizing problem with constant capabilities
1996
The authors develop an algorithm that solves the constant capacities economic...
Papers per page: