Skip to main content
SpringerLink
Log in

An efficient frontier for sum deviation JIT sequencing problem in mixed-model systems via apportionment

  • Published:
International Journal of Automation and Computing Aims and scope Submit manuscript

Abstract

In this paper, the sum deviation just-in-time (JIT) sequencing problem in mixed-model production systems is studied relating with the discrete apportionment problem together with their respective mathematical formulations. The assignment formulation for the first problem is briefly discussed followed by the existence of JIT cyclic sequences. Presenting the concise discussion on divisor methods for the discrete apportionment problem, we have proposed two mean-based divisor functions for this problem claiming that they are better than the existing divisors; hence, we found a better bound for the JIT sequencing problem. The linkage of both the problems is characterized in terms of similar type of objective functions. The problems are shown equivalent via suitable transformations and similar properties. The joint approaches for the two problems are discussed in terms of global and local deviations proposing equitably efficient solution.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Y. Monden. Toyota Production Systems: Practical Approach to Production Management, Norcross, USA: Industrial Engineering and Management Press, 1983.

    Google Scholar 

  2. T. N. Dhamala, W. Kubiak. A brief survey of just-in-time sequencing for mixed-model systems. International Journal of Operations Research, vol. 2, no. 2, pp. 38–47, 2005.

    MATH  Google Scholar 

  3. G. B. Thapa, T. N. Dhamala. Just-in-time sequencing in mixed-model production systems relating with fair representation in apportionment theory. The Nepali Mathematical Sciences Report, vol. 29, no. 1–2, pp. 29–68, 2009.

    Google Scholar 

  4. J. Miltenburg. Level schedules for mixed-model assembly lines in just-in-time production systems. Management Science, vol. 35, no. 2, pp. 192–207, 1989.

    Article  MATH  Google Scholar 

  5. W. Kubiak. Minimizing variation of production rates in just-in-time systems: A survey. European Journal of Operational Research, vol. 66, no. 3, pp. 259–271, 1993.

    Article  MATH  Google Scholar 

  6. W. Kubiak, S. P. Sethi. Optimal just-in-time schedules for flexible transfer lines. International Journal of Flexible Manufacturing Systems, vol. 6, no. 2, pp. 137–154, 1994.

    Article  Google Scholar 

  7. R. Inman, L. Bulfin. Sequencing just-in-time mixed-model assembly lines. Management Science, vol. 37, no. 7, pp. 901–904, 1991.

    Article  MATH  Google Scholar 

  8. M. Balinski, N. Shahidi. A simple approach to the product rate variation problem via axiomatics. Operations Research Letters, vol. 22, no. 4–5, pp. 129–135, 1998.

    Article  MathSciNet  MATH  Google Scholar 

  9. N. Boysen, M. Flieder, A. Scholl. Sequencing mixed-model assembly lines: Survey, classification and model critique. European Journal of Operational Research, vol. 192, no. 2, pp. 349–373, 2009.

    Article  MathSciNet  MATH  Google Scholar 

  10. T. N. Dhamala, S. R. Khadka. A review on sequencing approaches for mixed-model just-in-time production system. Iranian Journal of Optimization, vol. 1, no. 3, pp. 266–290, 2009.

    Google Scholar 

  11. S. J. Brams. Paradoxes in Politics: An Introduction to the Nonobvious in Political Science, New York, USA: Free Press, 1976.

    Google Scholar 

  12. M. Balinski, H. P. Young. Fair Representation: Meeting the Ideal of One Man, One Vote, 2ed ed., Washington D. C., USA: Brookings Institution Press, 2001.

    Google Scholar 

  13. J. Baustista, R. Companys, A. Corominas. Solving the generalized apportionment problem through the optimization of discrepancy functions. European Journal of Operational Research, vol. 131, no. 3, pp. 676–684, 2001.

    Article  MathSciNet  Google Scholar 

  14. B. A. Bradberry. A geometric view of some apportionment paradoxes. Mathematics Magazine, vol. 65, no. 1, pp. 3–17, 1992.

    Article  MathSciNet  MATH  Google Scholar 

  15. G. B. Thapa, T. N. Dhamala. A synthetic study to minimize the inequality measures in just-in-time sequencing problem via optimization methods. In Proceedings of the 5th Asian Mathematical Conference, Malaysia, pp. 462–470, 2009.

  16. M. Y. Kovalyov, W. Kubiak, J. S. Yeomans. A computational analysis of balanced JIT optimization algorithms. Information Processing and Operational Research, vol. 39, no. 3, pp. 299–316, 2001.

    Google Scholar 

  17. M. Balinski, H. P. Young. The quota method of apportionment. American Mathematical Monthly, vol. 82, pp. 701–729, 1975.

    Article  MathSciNet  MATH  Google Scholar 

  18. C. H. Papadimitrou, K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity, Portugal: Prentice Hall of India, 2003.

    Google Scholar 

  19. E. Balas, D. Miller, J. Pekny, P. Toth. A parallel shortest augmenting path algorithm for the assignment problem. Journal of the ACM, vol. 38, no. 4, pp. 985–1004, 1991.

    Article  MathSciNet  MATH  Google Scholar 

  20. W. Kubiak. Cyclic just-in-time sequences are optimal. Journal of Global Optimization, vol. 27, no. 2–3, pp. 333–347, 2003.

    Article  MathSciNet  MATH  Google Scholar 

  21. E. V. Huntington. The apportionment of representatives in congress. Transactions of the American Mathematical Society, vol. 30, no. 1, pp. 85–110, 1928.

    Article  MathSciNet  MATH  Google Scholar 

  22. M. L. Balinski, H. P. Young. On huntington methods of apportionment. SIAM Journal on Applied Mathematics, vol. 33, no. 4, pp. 607–618, 1977.

    Article  MathSciNet  MATH  Google Scholar 

  23. G. A. Bliss, E. Brown, L. Eisenhart, R. Pearl. Report to the president of national academy of sciences. In 70th congressional record, pp. 4966–4967, 1929.

  24. Morse, Marton, J. V. Newmann, L. P. Eisenhart. Report to the President of the National Academy of Sciences, USA, 1948.

  25. M. Balinski, V. Ramirez. Parametric methods of apportionment, rounding and production. Mathematical Social Sciences, vol. 37, no. 2, pp. 107–122, 1999.

    Article  MathSciNet  MATH  Google Scholar 

  26. J. Baustista, R. Companys, A. Corominas. A note on the relation between the product rate variation problem and the apportionment problem. The Journal of the Operational Research Society, vol. 47, no. 11, pp. 1410–1414, 1996.

    Google Scholar 

  27. J. Jozefowska, L. Jozefowski, W. Kubiak. Characterization of just-in-time sequencing via apportionment. International Series in Operations Research & Management Science, vol. 94, pp. 175–200, 2006.

    Article  MathSciNet  Google Scholar 

  28. A. Corominas, N. Moreno. On the relations between optimal solutions for different types of min-sum balanced justin-time optimization problems. Information Systems and Operations Research, vol. 41, no. 4, pp. 333–339, 2003.

    Google Scholar 

  29. S. Maier, P. Zachariassen, M. Zachariassen. Divisor-based biproportional apportionment in electoral systems: A reallife benchmark study. Management Science, vol. 56, no. 2, pp. 373–387, 2010.

    Article  Google Scholar 

  30. A. T. Yang, L. D. Zhao. Supply chain network equilibrium with revenue sharing contract under demand disruptions. International Journal of Automation and Computing, vol.8, no. 2, pp. 177–184, 2011.

    Article  Google Scholar 

  31. Z. Q. Sheng, C. P. Tang, C. X. Lv. Modeling of agile intelligent manufacturing-oriented production scheduling system. International Journal of Automation and Computing, vol.7, no. 4, pp. 596–602, 2010.

    Article  Google Scholar 

  32. M. Fliedner, N. Boysen, A. Scholl. Solving symmetric mixed-model multilevel just-in-time scheduling problems. Discrete Applied Mathematics, vol. 158, no. 3, pp. 222–231, 2010.

    Article  MathSciNet  MATH  Google Scholar 

  33. G. B. Thapa, T. N. Dhamala, H. Yu. Mathematical model of cross-docking operation in supply chain logistics under multi-level just-in-time production environment. The Nepali Mathematical Sciences Report, vol. 30, no. 1–2, pp. 24–35, 2010.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Central Department of Mathematics, Institute of Science and Technology, Tribhuvan University, Tribhuvan, Nepal

    Tanka Nath Dhamala

  2. Department of Mathematics, Pulchowk Campus, Institute of Engineering, Tribhuvan University, Tribhuvan, Nepal

    Gyan Bahadur Thapa

  3. Faculty of Computing, Engineering and Technology, Staffordshire University, Stafford, UK

    Hong-Nian Yu

Authors
  1. Tanka Nath Dhamala
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gyan Bahadur Thapa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hong-Nian Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gyan Bahadur Thapa.

Additional information

This work was supported by the e-LINK project (EM ECW-ref. 149674-EM-1-UK-ERAMUNDUS), EU for its financial support to carry out the work at Staffordshire University, Stafford, UK.

Tanka Nath Dhamala received the master degree in 1989 in mathematics from Tribhuvan University (TU), Nepal, and the M. Sc. degree in industrial mathematics in 1996 from University of Kaiserslautern, Germany. He received the Ph.D. degree in discrete optimization from the University of Magdeburg, Germany in 2002. He was post-doctorate fellow in Memorial University of Newfoundland, Canada in 2004/2005. As a researcher, he has visited some universities in Germany, France, Canada, USA, and South Korea. He was an assistant professor from 1993 to 2009 in Central Department of Mathematics, TU, Nepal. Currently, he is an associate professor in Central Department of Mathematics, TU, Nepal. He is member secretary of research committee there since 2006 and life member of Nepal Mathematical Society.

His research interests include scheduling, combinatorial optimization, optimization techniques of operations research, mathematical modeling of real-life problems, computer science, and information technology.

Gyan Bahadur Thapa received the master degree in 1995 and PGDE in 1997 in mathematics from Tribhuvan University, Nepal. He is an assistant professor of mathematics in Institute of Engineering, Tribhuvan University, Kathmandu, Nepal since 1999. He had been to Germany in a research visit in 2006/2007 and Malaysia in a conference visit in 2009. He is life member of Nepal Mathematical Society. He is pursuing his Ph.D. degree in discrete Optimization from Institute of Science and Technology, Tribhuvan University, Nepal. He was a research scholar in Staffordshire University, UK for 10 months from November 2009 to September 2010 under e-LINK project (EM ECW-ref.149674-EM-1-UK-ERAMUNDUS) funded by European Union.

His research interests include applied mathematics, optimization, and supply chain management.

Hong-Nian Yu received the Ph.D. degree in robotics at King’s College, London, UK in 1990–1994. He was a lecturer in control and system engineering at Yanshan University, PRC, in 1985–1990, a research fellow in manufacturing systems at Sussex University, UK in 1994–1996, a lecturer in artificial intelligence at Liverpool John Moore’s University, UK in 1996–1999, a lecturer in control and system engineering at the university of Exter, UK in 1999–2002, and a senior lecturer in computing at the University of Bradford, UK in 2002–2004. Currently, he is professor of computer science and head of Mobile Computing and Distributed Control Systems Research Group at Staffordshire University, UK. He is an EPSRC college member, a member of IEEE, and a committee member of several conferences and journal editorial boards.

His research interests include experience in neural networks, mobile computing, modelling, control of robot manipulators and modelling, scheduling, planning and simulations of large discrete event dynamic systems with applications to manufacturing systems, supply chains, transportation networks and computer networks.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dhamala, T.N., Thapa, G.B. & Yu, HN. An efficient frontier for sum deviation JIT sequencing problem in mixed-model systems via apportionment. Int. J. Autom. Comput. 9, 87–97 (2012). https://doi.org/10.1007/s11633-012-0620-x

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11633-012-0620-x

Keywords

Search

Navigation