Some extensions of the discrete lotsizing and scheduling problem

@inproceedings{Salomon1991SomeEO,
  title={Some extensions of the discrete lotsizing and scheduling problem},
  author={M. Salomon and Leo G. Kroon and Roelof Kuik and Luk N. Van Wassenhove},
  year={1991}
}
In this paper the Discrete Lotsizing and Scheduling Problem (DLSP) is considered. DLSP relates to capacitated lotsizing as well as to job scheduling problems and is concerned with determining a feasible production schedule with minimal total costs in a single-stage manufacturing process. This involves the sequencing and sizing of production lots for a number of different items over a discrete and finite planning horizon. Feasibility of production schedules is subject to production quantities… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 45 CITATIONS

The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability

  • European Journal of Operational Research
  • 2000
VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Problems, Models and Complexity. Part II: Application to the DLSP

  • J. Math. Model. Algorithms
  • 2003
VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

References

Publications referenced by this paper.
SHOWING 1-6 OF 6 REFERENCES

WASSENHOVE, "The Discrete Lotsizing and Scheduling Problem." Working Paper 30. Rotterdam School of Management. Erasmus University Rotterdam

SALOMON.M.. L.G. KROON, R. KUIK, L. N . VAN
  • The Netherlands (NL)
  • 1989

VANDERHENST, "Planning Production in a Bottleneck Department,

L. N. VAN WASSENHOVE
  • European J. Oper. Res.
  • 1983