Abstract
In this chapter, we introduce the concept of the clearing function (CF), a metamodel of a production resource that relates the expected output of a resource to some measure of the work available to it in the planning period. We focus on clearing functions with a single state variable and examine a variety of functional forms that have been proposed in the production and traffic literature. We then formulate release planning models using these functions and show that while single-product models yield tractable convex optimization problems, the presence of multiple products competing for capacity at a shared resource creates significant difficulties. The allocated clearing function formulation is presented to address these issues and shown to yield more informative dual prices for resource capacity than conventional LP models.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Asmundsson J, Rardin RL, Uzsoy R (2006) Tractable nonlinear production planning models for semiconductor wafer fabrication facilities. IEEE Trans Semicond Manuf 19(1):95–111
Asmundsson J, Rardin RL, Turkseven CH, Uzsoy R (2009) Production planning with resources subject to congestion. Naval Res Logistics 56(2):142–157
Boyd S, Vandenberghe L (2009) Convex optimization. Cambridge University Press, Cambridge
Buzacott JA, Shanthikumar JG (1993) Stochastic models of manufacturing systems. Prentice-Hall, Englewood Cliffs, NJ
Carey M (1987) Optimal time-varying flows on congested networks. Oper Res 35(1):58–69
Carey M (1992) Nonconvexity of the dynamic traffic assignment problem. Transport Res B 26B(2):127–133
Carey M, Bowers M (2012) A review of properties of flow–density functions. Transport Rev 32(1):49–73
Carey M, Subrahmanian E (2000a) An approach to modelling time-varying flows on congested networks. Transport Res B 34:157–183
Carey M, Subrahmanian E (2000b) An approach to modelling time-varying flows on congested networks. Transport Res Pt B Methodological 34(6):547
Curry GL, Feldman RM (2000) Manufacturing systems modelling and analysis. Springer, Berlin
Dafermos SC, Sparrow FT (1969) The traffic assignment problem for a general network. J Res Natl Bureau Standard B Math Sci 73B(2):91–118
Franklin RE (1961) The structure of a traffic shock wave. Civil Eng Publ Works Rev 56:1186–1188
Gopalswamy K, Uzsoy R (2018) Conic programming reformulations of production planning problems research report. Edward P. Fitts Department of Industrial and Systems Engineering, North Carolina State University. Raleigh, NC
Gopalswamy K, Uzsoy R (2019) A data-driven iterative refinement approach for estimating clearing functions from simulation models of production systems. Int J Prod Res 57(19), 6013–6030.
Gopalswamy K, Fathi Y, Uzsoy R (2019) Valid inequalities for concave piecewise linear regression. Oper Res Lett 47:52–58
Graves SC (1986) A tactical planning model for a job shop. Oper Res 34(4):522–533
Graves SC (1988) Safety stocks in manufacturing systems. J Manuf Oper Manag 1:67–101
Graves SC, Kletter DB, Hetzel WB (1998) Dynamic model for requirements planning with application to supply chain optimization. Oper Res 46(3):35–49
Hackman ST, Leachman RC (1989) A general framework for modeling production. Manag Sci 35(4):478–495
Hannah LA, Dunson LA (2013) Multivariate convex regression with adaptive partitioning. J Mach Learn Res 14(1):3261–3294
Hopp WJ, Spearman ML (2008) Factory physics: foundations of manufacturing management. Irwin/McGraw-Hill, Boston
Imamoto A, Tang B (2008) Optimal piecewise linear approximation of convex functions. World Congress on Engineering and Computer Science, San Francisco, CA
Johnson LA, Montgomery DC (1974) Operations research in production planning, scheduling and inventory control. Wiley, New York
Kacar NB, Moench L, Uzsoy R (2016) Modelling cycle times in production planning models for wafer fabrication. IEEE Trans Semicond Manuf 29(2):153–167
Karmarkar US (1989) Capacity loading and release planning with work-in-progress (WIP) and lead-times. J Manuf Oper Manag 2(1):105–123
Kefeli A, Uzsoy R (2016) Identifying potential bottlenecks in production systems using dual prices from a mathematical programming model. Int J Prod Res 54(7):2000–2018
Leachman RC (2001) Semiconductor production planning. In: Pardalos PM, Resende MGC (eds) Handbook of applied optimization. Oxford University Press, New York, pp 746–762
Merchant DK, Nemhauser GL (1978) A model and an algorithm for the dynamic traffic assignment problems. Transport Sci 12(3):183–199
Missbauer H (1998) Bestandsregelung als Basis für eine Neugestaltung von PPS-Systemen. Physica, Heidelberg
Missbauer H (2002) Aggregate order release planning for time-varying demand. Int J Prod Res 40:688–718
Newell G (1961) A theory of traffic flow in tunnels. In: Herman R (ed) Theory of traffic flow. Elsevier, Amsterdam, pp 193–206
Nyhuis P, Wiendahl HP (2009) Fundamentals of production logistics: theory, tools and applications. Springer, Berlin
Parrish SH (1987) Extensions to a model for tactical planning in a job shop environment. Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA
Peeta S, Ziliaskopoulos AK (2001) Foundations of dynamic traffic assignment: the past, the present and the future. Netw Spat Econ 1(3-4):233–265
Pochet Y, Wolsey LA (2006) Production planning by mixed integer programming. Springer Science and Business Media, New York
Srinivasan A, Carey M, Morton TE (1988) Resource pricing and aggregate scheduling in manufacturing systems. Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA
Teo C, Bhatnagar R, Graves SC (2011) Setting planned lead times for a make-to-order production system with master schedule smoothing. IIE Trans 43:399–414
Teo C, Bhatnagar R, Graves SC (2012) An application of master schedule smoothing and planned lead time control. Prod Oper Manag 21(2):211–223
Toriello A, Vielma JP (2012) Fitting piecewise linear continuous functions. Eur J Oper Res 219:86–95
Turkseven CH (2005) Computational evaluation of production planning formulations using clearing functions. School of Industrial Engineering, Purdue University, West Lafayette, IN
Van Aerde M, Rakha H (1995) Multivariate calibration of single regime speed–flow–density relationships. 6th Vehicle Navigation and Information Systems (VNIS) Conference, Seattle, WA
Van Ooijen HPG, Bertrand JWM (2003) The effects of a simple arrival rate control policy on throughput and work-in-process in production systems with workload dependent processing rates. Int J Prod Econ 85(1):61–68
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Science+Business Media, LLC, part of Springer Nature
About this chapter
Cite this chapter
Missbauer, H., Uzsoy, R. (2020). Univariate Clearing Functions. In: Production Planning with Capacitated Resources and Congestion. Springer, New York, NY. https://doi.org/10.1007/978-1-0716-0354-3_7
Download citation
DOI: https://doi.org/10.1007/978-1-0716-0354-3_7
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-0716-0352-9
Online ISBN: 978-1-0716-0354-3
eBook Packages: Business and ManagementBusiness and Management (R0)