Search results

Filters

  • Journals
  • Authors
  • Keywords
  • Date
  • Type

Search results

Number of results: 2
items per page: 25 50 75
Sort by:
Download PDF Download RIS Download Bibtex

Abstract

Small bucket models with many short fictitious micro-periods ensure high-quality schedules in multi-level systems, i.e., with multiple stages or dependent demand. In such models, setup times longer than a single period are, however, more likely. This paper presents new mixedinteger programming models for the proportional lot-sizing and scheduling problem (PLSP) with setup operations overlapping multiple periods with variable capacity.
A new model is proposed that explicitly determines periods overlapped by each setup operation and the time spent on setup execution during each period. The model assumes that most periods have the same length; however, a few of them are shorter, and the time interval determined by two consecutive shorter periods is always longer than a single setup operation. The computational experiments showthat the newmodel requires a significantly smaller computation effort than known models.
Go to article

Bibliography

[1] I. Barany, T.J. van Roy and L.A. Wolsey: Uncapacitated lot-sizing: The convex hull of solutions. Mathematical Programming Studies, 22 (1984), 32–43, DOI: 10.1007/BFb0121006.
[2] G. Belvaux and L.A. Wolsey: Modelling practical lot-sizing problems as mixed-integer programs. Management Science, 47(7), (2001), 993–1007, DOI: 10.1287/mnsc.47.7.993.9800.
[3] J.D. Blocher, S. Chand and K. Sengupta: The changeover scheduling problem with time and cost considerations: Analytical results and a forward algorithm. Operations Research, 47(7), (1999), 559-569, DOI: 10.1287/opre.47.4.559.
[4] W. Bozejko, M. Uchronski and M. Wodecki: Multi-machine scheduling problem with setup times. Archives of Control Sciences, 22(4), (2012), 441– 449, DOI: 10.2478/v10170-011-0034-y.
[5] W. Bozejko, A. Gnatowski, R. Idzikowski and M. Wodecki: Cyclic flow shop scheduling problem with two-machine cells. Archives of Control Sciences, 27(2), (2017), 151–167, DOI: 10.1515/acsc-2017-0009.
[6] D. Cattrysse, M. Salomon, R. Kuik and L. vanWassenhove: A dual ascent and column generation heuristic for the discrete lotsizing and scheduling problem with setup times. Management Science, 39(4), (1993), 477–486, DOI: 10.1287/mnsc.39.4.477.
[7] K. Copil, M. Worbelauer, H. Meyr and H. Tempelmeier: Simultaneous lotsizing and scheduling problems: a classification and review of models. OR Spectrum, 39(1), (2017), 1–64, DOI: 10.1007/s00291-015-0429-4.
[8] A. Drexl and K. Haase: Proportional lotsizing and scheduling. International Journal of Production Economics, 40(1), (1995), 73–87, DOI: 10.1016/0925-5273(95)00040-U.
[9] B. Fleischmann: The discrete lot-sizing and scheduling problem. European Journal of Operational Research, 44(3), (1990), 337-348, DOI: 10.1016/0377-2217(90)90245-7.
[10] K. Haase: Lotsizing and scheduling for production planning. Number 408 in Lecture Notes in Economics and Mathematical Systems. Springer-Verlag, Berlin, 1994.
[11] W. Kaczmarczyk: Inventory cost settings in small bucket lot-sizing and scheduling models. In Total Logistic Management Conference, Zakopane, Poland, November 25-28 2009.
[12] W. Kaczmarczyk: Modelling multi-period set-up times in the proportional lot-sizing problem. Decision Making in Manufacturing and Services, 3(1-2), (2009), 15–35, DOI: 10.7494/dmms.2009.3.2.15.
[13] W. Kaczmarczyk: Proportional lot-sizing and scheduling problem with identical parallel machines. International Journal of Production Research, 49(9), (2011), 2605–2623, DOI: 10.1080/00207543.2010.532929.
[14] W. Kaczmarczyk: Valid inequalities for proportional lot-sizing and scheduling problem with fictitious microperiods. International Journal of Production Economics, 219(1), (2020), 236–247, DOI: 10.1016/j.ijpe.2019.06.005.
[15] W.Kaczmarczyk: Explicit modelling of multi-period setup times in proportional lot-sizing problem with constant capacity. (2021), Preprint available at Research Square, DOI: 10.21203/rs.3.rs-1086310/v1.
[16] U.S. Karmarkar and L. Schrage: The deterministic dynamic product cycling problem. Operations Research, 33(2), (1985), 326–345, DOI: 10.1287/opre.33.2.326.
Go to article

Authors and Affiliations

Waldemar Kaczmarczyk
1

  1. Department of Strategic Management, AGH University of Science and Technology, Al.Mickiewicza 30, 30-059, Kraków, Poland
Download PDF Download RIS Download Bibtex

Abstract

In the paper, we present a coordinated production planning and scheduling problem for three major shops in a typical alloy casting

foundry, i.e. a melting shop, molding shop with automatic line and a core shop. The castings, prepared from different metal, have different

weight and different number of cores. Although core preparation does not required as strict coordination with molding plan as metal

preparation in furnaces, some cores may have limited shelf life, depending on the material used, or at least it is usually not the best

organizational practice to prepare them long in advance. Core shop have limited capacity, so the cores for castings that require multiple

cores should be prepared earlier. We present a mixed integer programming model for the coordinated production planning and scheduling

problem of the shops. Then we propose a simple Lagrangian relaxation heuristic and evolutionary based heuristic to solve the coordinated

problem. The applicability of the proposed solution in industrial practice is verified on large instances of the problem with the data

simulating actual production parameters in one of the medium size foundry.

Go to article

Authors and Affiliations

A. Stawowy
J. Duda

This page uses 'cookies'. Learn more