Abstract
Many approaches to production scheduling are based on the step by step improvement of a given schedule. For these, finding a “good” initial schedule may critically influence performance. In the following, an extremely fast and simple method is presented for finding such a schedule in the case of a continuous-time single machine problem with the goal of minimizing setup and holding costs. In the case where there are no setups, this method always finds the optimal solution. A benchmark illustrates the possibilities of the method.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brahimi, N., Dauzere-Peres, S., Najid, N.M., Nordli, A.: Single item lot sizing problems. European Journal of Operational Research 168(1), 1–16 (2005)
Cattrysse, D., Salomon, M., Kuik, R., van Wassenhove, L.N.: A dual ascent and column generation heuristic for the discrete lotsizing and scheduling problem with setup-times. Management Science 39, 477–486 (1993)
Florian, M., Lenstra, J.K., Kan, A.H.G.R.: Deterministic Production Planning Algorithms and Complexity. Management Science 26(7), 669–679 (1980)
Gavish, B., Johnson, R.E.: A fully polynomial approximation scheme for single-product scheduling in a finite capacity facility. Operations Research 38(1), 70–83 (1990)
Harris, F.W.: How many parts to make at once, Factory: The Magazine of Management 10/2. 135-136, Reprint, Operations Research 38(6), 947–950 (1913)
Hsu, W.L.: On the general feasibility test of scheduling lot sizes for several products on one machine. Management Science 29(1), 93–105 (1983)
Jodlbauer, H.: An approach for integrated scheduling and lot-sizing. European Journal of Operational Research 172(2), 386–400 (2006)
Jodlbauer, H., Reitner, S., Weidenhiller, A.: Reformulation and Solution Approaches for an Integrated Scheduling Model. In: Gavrilova, M., Gervasi, O., Kumar, V., Tan, C.J.K., Taniar, D., Laganà, A., Mun, Y., Choo, H. (eds.) ICCSA 2006. LNCS, vol. 3984, pp. 88–97. Springer, Heidelberg (2006)
Jordan, C., Drexl, A.: Discrete Lotsizing and Scheduling by Batch Sequencing. Management Science 44(5), 698–713 (1998)
Salomon, M.: Deterministic lotsizing models for production planning. Springer, Berlin (1991)
Taft, E.W.: The most economical production lot (Formulas for exact and approximate evaluation – handling cost of jigs and interest charges of product manufactured included). The Iron Age 101, 1410–1412 (1918)
Van Hoesel, C.P.M., Wagelmans, A.P.M.: Fully polynomial approximation schemes for single-item capacitated economic lot-sizing problems. Mathematics of Operations Research 26(2), 339–357 (2001)
Wagner, H.M., Whitin, T.M.: Dynamic version of the economic lot size model. Management Science 5(1), 89–96 (1958)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Weidenhiller, A., Jodlbauer, H. (2007). Fast Generation of Production Schedules on a Single Machine. In: Moreno Díaz, R., Pichler, F., Quesada Arencibia, A. (eds) Computer Aided Systems Theory – EUROCAST 2007. EUROCAST 2007. Lecture Notes in Computer Science, vol 4739. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75867-9_108
Download citation
DOI: https://doi.org/10.1007/978-3-540-75867-9_108
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75866-2
Online ISBN: 978-3-540-75867-9
eBook Packages: Computer ScienceComputer Science (R0)