van Hoesel, S., Kolen, A., (1994), A Linear Description of the Discrete Lot--Sizing and Scheduling Problem, European Journal of Operational Research, Vol. 75, pp. 342--353 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Genetic Algorithm for Multi-Level, Multi-Machine Lot Sizing and.. - Kimms (1996) (1 citation) (Correct)
....the problem is known as the proportional lot sizing and scheduling problem (PLSP) 6, 12, 22] By choosing the length of each time period appropriately small, the PLSP is a good approximation to a continuous time axis. It refines the well known discrete lot sizing and scheduling problem (DLSP) [4, 8, 15, 24, 30] as well as the continuous setup lot sizing problem (CSLP) 1, 18, 17] Both assume that at most one item may be produced per period. All three models could be classified as small bucket models since only a few (one or two) items are produced per period. In contrast to this, the well known ....
van Hoesel, S., Kolen, A., (1994), A Linear Description of the Discrete Lot--Sizing and Scheduling Problem, European Journal of Operational Research, Vol. 75, pp. 342--353
Improved Lower Bounds for the Proportional Lot Sizing and.. - Kimms (1996) (Correct)
....the problem is known as the proportional lot sizing and scheduling problem (PLSP) 4, 12, 23] By choosing the length of each time period appropriately small, the PLSP is a good approximation to a continuous time axis. It refines the well known discrete lot sizing and scheduling problem (DLSP) [3, 8, 17, 25, 31] as well as the continuous setup lot sizing problem (CSLP) 1, 18, 19] Both assume that at most one item may be produced per period. All three models could be classified as small bucket models since only a few (one or two) items are produced per period. In contrast to this, the well known ....
van Hoesel, S., Kolen, A., (1994), A Linear Description of the Discrete Lot--Sizing and Scheduling Problem, European Journal of Operational Research, Vol. 75, pp. 342--353
Polyhedral Techniques in Combinatorial Optimization I: Theory - Aardal, van Hoesel (1995) (1 citation) Self-citation (Van hoesel) (Correct)
....a fixed number of variables. Although not specifically a result in polyhedral combinatorics, it is central in integer programming and combinatorial optimization. If we consider more problem specific results, lot sizing problems have been considered by Van Eijl, Van Hoesel, Kolen and Wagelmans, see Van Hoesel and Kolen (1994), Van Hoesel, Wagelmans, and Wolsey (1994) Van Eijl and Van Hoesel (1995) Van Hoesel, Kolen and Van Eijl (1995) Gerards and Schrijver characterize graphs for which the node packing polytope is described completely by certain constraints, see Gerards and Schrijver (1986) Gerards (1989) and ....
S. van Hoesel and A. Kolen (1994) "A linear description of the discrete lot sizing and scheduling problem", European Journal of Operational Research 75 pages 342--353.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC