Name
Abstract | ||
|---|---|---|
We consider the single-item discrete lot-sizing and scheduling problem. We present a partial linear description of the convex hull of feasible solutions that solves this problem in the presence of Wagner-Whitin costs. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1016/S0167-6377(96)00043-0 | The American Journal of Clinical Nutrition |
Keywords | Field | DocType |
convex hull,lot-sizing,partial linear description,polyhedral combinatorics,wagner-whitin cost,single-item discrete lot-sizing,feasible solution,scheduling problem | Mathematical optimization,Multiprocessor scheduling,Job shop scheduling,Fair-share scheduling,Computer science,Convex hull,Nurse scheduling problem,Sizing,Dynamic priority scheduling,Optimization problem,Operations management | Journal |
Volume | Issue | ISSN |
20 | 1 | Operations Research Letters |
Citations | PageRank | References |
9 | 1.26 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| C. A. Van Eijl | 1 | 9 | 1.26 |
| C. P. M. Van Hoesel | 2 | 93 | 8.07 |