Abstract
The just in time sequencing is used to balance workloads throughout just in time supply chains intended for low-volume high-mix family of products. It renders supply chains more stable and carrying less inventories of final products and components but at the same time it ensures less shortages. A number of algorithms have been proposed in the literature to optimize just in time sequencing. This paper characterizes these algorithms via characteristics developed by the apportionment theory.
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
Balinski, M., Ramirez, V. (1999). Parametric methods of apportionment, rounding and production. Mathematical Social Sciences 37, 107–122.
Balinski, M., Shahidi, N. (1998). A simple approach to the product rate variation problem via axiomatics. Operation Research Letters 22, 129–135.
Balinski, M., Young, H. (1975). The Quota Method of Apportionment. American Mathematical Monthly 82, 450–455.
Balinski, M., Young, H. (1982). Fair Representation. Meeting the Ideal of One Man, One Vote, Yale University Press.
Bautista, J., Companys, R., Corominas, A. (1996). A Note on the Relation between the Product Rate Variation (PRV) Problem and the Apportionment Problem. Journal of the Operational Research Society 47, 1410–1414.
Brauner, N., Crama, Y. (2004). The maximum deviation just-in-time scheduling problem. Discrete Applied Mathematics 134, 25–50.
Corominas, A., Moreno, N. (2003). About the relations between optimal solutions for different types of min-sum balanced JIT optimisation problems. Information Systems and Operational Research 41, 333–339.
Groenevelt, H., (1993). The Just-in-Time Systems, In: Graves, S.C., Rinnooy Kan, A.H.G., Zipkin, P.H., editors, Handbooks in Operations Research and Management Science Vol. 4, North Holland.
Inman, R., Bulfin, R. (1991). Sequencing JIT mixed-model assembly lines. Management Science 37, 901–904.
Kubiak, W. (2004). Fair sequences. In: Leung, J. Y-T., editor, Handbook of Scheduling, Chapman & Hall/CRC Computer and Information Science Series.
Kubiak, W. (2005). Balancing Mixed-Model Supply Chains, Chapter 6 in Volume 8 of the GERAD 25th Anniversary Series, Springer.
Kubiak, W., Sethi, S. (1991). A note on: Level schedules for mixedmodel assembly lines in just-in-time production systems. Management Science 37, 121–122.
Kubiak, W., Sethi, S. (1994). Optimal level schedules for flexible assembly lines in JIT production systems. International Journal of Flexible Manufacturing Systems 6, 137–154.
Miltenburg, J. (1989). Level schedules for mixed-model assembly lines in just-in-time production systems. Management Science 35, 192–207.
Monden, Y., (1983). Toyota Production Systems. Industrial Engineering and Management Press, Norcross, GA.
Steiner, G., Yeomans, S. (1993). Level Schedules for Mixed-model, Justin-Time Processes. Management Science 39, 728–735.
Still, J.W. (1979). A class of new methods for Congressional Apportionment. SIAM Journal on Applied Mathematics 37, 401–418.
Tijdeman, R. (1980). The chairman assignment problem. Discrete Mathematics 32, 323–330.
Vollman, T.E., Berry, W.L., Wybark, D.C. (1992). Manufacturing Planning and Control Systems, 3rd edition, IRWIN.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Józefowska, J., Józefowski, Ł., Kubiak, W. (2006). Characterization of Just in Time Sequencing via Apportionment. In: Yan, H., Yin, G., Zhang, Q. (eds) Stochastic Processes, Optimization, and Control Theory: Applications in Financial Engineering, Queueing Networks, and Manufacturing Systems. International Series in Operations Research & Management Science, vol 94. Springer, Boston, MA . https://doi.org/10.1007/0-387-33815-2_10
Download citation
DOI: https://doi.org/10.1007/0-387-33815-2_10
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-33770-8
Online ISBN: 978-0-387-33815-6
eBook Packages: EngineeringEngineering (R0)