Practical Tips for Modelling Lot-Sizing and Scheduling Problems

• Autorzy: Waldemar Kaczmarczyk
• Języki publikacji: EN

Abstrakty

EN

This paper presents some important alternatives for modelling Lot-Sizing and Scheduling Problems. First, the accuracy of models can improved by using short time buckets, which allow more detailed planning but lead to higher computational effort. Next, valid inequalities make the models tighter but increase their size. Sometimes it is possible to find a good balance between the size and tightness of a model by limiting a priori the number of valid inequalities. Finally, a special normalization of the variables simplifies the presentation of results and validation of models. (original abstract)

Słowa kluczowe

EN

Production; Mathematical programming; Supply chain; Schedule

PL

Produkcja; Programowanie matematyczne; Łańcuch dostaw; Harmonogram

• Czasopismo: Decision Making in Manufacturing and Services
• Rocznik: 2009
• Tom: 3
• Numer: nr 1/2
• Strony: 37--48

Twórcy

autor

Waldemar Kaczmarczyk

• AGH University of Science and Technology Kraków, Poland

Bibliografia

• Belvaux, G., Wolsey, L.A. (2001). Modelling practical lot-sizing problems as mixed-integer programs, Management Science 47(7): 993-1007.
• Drexl, A., Haase, K. (1995). Proportional lotsizing and scheduling, International Journal of Production Economics 40: 73-87.
• Drexl, A., Kimms, A. (1997). Lot sizing and scheduling - survey and extensions, European Journal of Operational Research 99(2): 221-235.
• Fleischmann, B. (1990). The discrete lot-sizing and scheduling problem, European Journal of Operational Research 44(3): 337-348.
• Fleischmann, B. (1994). The discrete lot-sizing and scheduling problem with sequencedependent setup costs, European Journal of Operational Research 75(2): 395-404.
• Haase, K. (1994). Lotsizing and scheduling for production planning, number 408 in Lecture Notes in Economics and Mathematical Systems, Springer-Verlag.
• Haase, K. (1996). Capacitated lot sizing with linked production quantities of adjacent periods, Technical report, Working Paper 334, Institut fur Betriebswirtschaftslehre, Christian-Albrechts-Universitat zu Kiel, Germany.
• Jans, R., Degraeve, Z. (2008). Modeling industrial lot sizing problems: a review, International Journal of Production Research 46(6): 1619-1643.
• Kaczmarczyk, W. (2010). Proportional lot-sizing and scheduling problem with identical parallel machines, International Journal of Production Research. Accepted for publication.
• Pochet, Y., Wolsey, L.A. (2006). Production planning by mixed integer programming, Series in Operations Research and Financial Engineering, Springer, New York.
• Sox, C.R., Gao, Y. (1999). The capacitated lot sizing problem with setup carry-over, IIE Transactions 31: 173-181.
• Suerie, C. (2005). Time Continuity in Discrete Time Models, Springer.
• Suerie, C., Stadtler, H. (2003). The capacitated lot-sizing problem with linked lot sizes, Management Science 49 (8): 1039-1054.
• Wagner, H.M., Whitin, T.M. (1958). Dynamic version of the economic lot size model, Management Science 5: 89-96.
• Wolsey, L.A. (2002). Solving multiitem lot-sizing problems with an MIP solver using classification and reformulation, Management Science 48(12): 1587-1602.