Skip to main content
Springer Nature Link
Log in

Optimizing control dynamic complexity and production schedule

  • Original Paper
  • Published:
International Journal on Interactive Design and Manufacturing (IJIDeM) Aims and scope Submit manuscript

Abstract

Over the last few decades sophisticated line balancing methodologies have been developed in response to the emerging trend of lean production in order to more effectively streamline production sequence scheduling. Newer approaches now demonstrate the potential to achieve lean production while at the same time simplifying what have become increasingly complex analytical methodologies and production sequences. Unlike past studies on line balancing for mixed-model production lines, in this paper the impacts of line balance on Control Dynamic Complexity are investigated and their deployment illustrated with a case study. Precedence matrices have been studied and a combined precedence matrix computed. The mathematical programming language Matlab is employed to illustrate state diagrams representing the relationships between the tasks and terminals. It is found that control dynamic complexities are higher for some particular sequences, and in such cases further explanations are offered. Furthermore, this study reveals that it is possible to minimize the complexities by better exploiting some aspects of line scheduling guidelines. Since line balancing and line scheduling are NP hard issues, this paper has also demonstrated ways in which computational analysis of multiple iterations can be significantly accelerated in future by deploying ant colony optimization techniques. Analysis of complexity level highlights what may otherwise be intuitive, that excessive sophistication of line balance techniques is very likely to be detrimental to an overall organization if resulting scheduling becomes difficult to practically monitor.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21

Similar content being viewed by others

References

  1. Vigano, R., Ginezm, G.O.: Automatic assembly sequence exploration without precedence definition. Int. J. Interact. Des. Manuf. 7, 79–89 (2013)

    Article  Google Scholar 

  2. Vosniakos, G.C., Gogouvitis, X.V.: Structured design of flexibly automated manufacturing cells through semantic models and petri nets in a virtual reality environment. Int. J. Interact. Des. Manuf. 9, 45–63 (2015)

    Article  Google Scholar 

  3. Luiza, D., Daniela, G., Alexandrus, E.: Modeling and estimation of the product time and cost in manufacturing system-market relationship. Int. J. Interact. Des. Manuf. 8, 277–282 (2014)

    Article  Google Scholar 

  4. Zhao, C., Li, J., Huang, N., DeCroix, G.: Optimal planning of plant flexibility: Problem formulation and performance analysis. IEEE Trans. Autom. Sci. Eng. 14(2), 718–731 (2017)

    Article  Google Scholar 

  5. Thomopoulos, N.T.: Mixed model line balancing with smoothed station assigments. Manag. Sci. 16(9), B59–B75 (1970)

    Article  Google Scholar 

  6. Fokkert, J.I.Z.: The mixed and multi model line balancing problem: a comparison. Eur. J. Oper. Res. 100, 399–412 (1997)

    Article  MATH  Google Scholar 

  7. Emde, S., Boysen, N., Scholl, A.: Balancing mixed-model assembly lines: a computational evaluation of objectives to smoothen workload. Int. J. Prod. Res. 48(11), 3173–3191 (2010)

    Article  MATH  Google Scholar 

  8. Raj, V., Mathewa, J., Josea, P., Sivana, G.: Optimization of cycle time in an assembly line balancing problem. ScienceDirect. Procedia Technol. 25, 1146–1153 (2016)

    Article  Google Scholar 

  9. Legarretaetxebarria, A., Quartulli, M., Olaizola, I., Serrano, M.: Optimal scheduling of manufacturing processes across multiple production lines by polynomial optimization and bagged bounded binary knapsackp. Int. J. Interact. Des. Manuf. 8, 277–282 (2014)

    Article  Google Scholar 

  10. Young R.: 8 ways to... reduce complexity. Financial Manag. 36–37 (2011)

  11. Dix, J.: Getting a handle on complexity. Network World. ProQuest (2011)

  12. Shannon, C.E.: The mathematical theory of communication. Bell Syst. Tech. J. 27, 379–423 (1948)

    Article  MathSciNet  MATH  Google Scholar 

  13. ElMaraghy, W.H., Urbanic, R.J.: Modelling of manufacturing systems complexity. CIRP Ann. Manuf. Technol. 52(1), 363–366 (2003)

    Article  Google Scholar 

  14. Fanti, M.P., Rotunno, G., Stecco, G., Ukovich, W., Mininel, S.: An integrated system for production scheduling in steelmaking and casting plants. IEEE Trancs. Autom. Sci. Eng. 13(2), 1112–1128 (2016)

    Article  Google Scholar 

  15. Deshmukh, A.V., Talavag, J.J., Barash, M.M.: Complexity in manufacturing systems Part 1: analysis of static complexity. IIE Trans. 30(7), 645–655 (1998)

    Google Scholar 

  16. Alamoudi, R.H.: Interaction based measure of manufacturing systems complexity and supply chain systems vulnerability using Information Entropy. Ph.D. Dissertation Submitted to the Faculty of the University of Miami (2008)

  17. Martin, K.: Entropy as a fixed point. Theor. Comput. Sci. 350, 292–324 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  18. Zhang, Z., Xiao, R.: Empirical study on entropy models of cellular manufacturing systems. Prog. Nat. Sci. 19, 389–395 (2009)

    Article  Google Scholar 

  19. Zhang, Z.: Manufacturing complexity and its measurement based on entropy models. Int. J. Adv. Manuf. Technol. 62, 867–873 (2012)

    Article  Google Scholar 

  20. Zhang, Z.: Modeling complexity of cellular manufacturing systems. Appl. Math. Model. 35, 4189–4195 (2011)

    Article  Google Scholar 

  21. Smart, J., Calinescu, A., Huatuco, L.H.: Extending the informationtheoretic measures of the dynamic complexity of manufacturing systems. Int. J. Prod. Res. 51(2), 362–379 (2013)

    Article  Google Scholar 

  22. Frizelle, G., Woodcock, E.: Measuring complexity as an aid to developing operational strategy. Int. J. Oper. Prod. Manag. 15(5), 26–39 (1995)

    Article  Google Scholar 

  23. Cho, S., Alamoudi, R., Asfour, S.: Interaction-based complexity measure of manufacturing systems using information entropy. Int. J. Comput. Integr. Manuf. 22(10), 909–922 (2009)

    Article  Google Scholar 

  24. Baewicz, J., Ecker, K.H., Pesch, E., Schmid, G., Weglarz, J.: Scheduling Computer and Manufacturing Processes, 2nd edn, pp. 9–36. Springer, Berlin (2001)

    Google Scholar 

  25. Duan, Q., Zeng, J., Chakrabarty, K., Dispoto, G.: Real-time production scheduler for digital-print-service providers based on a dynamic incremental evolutionary algorithm. IEEE Trans. Autom. Sci. Eng. 12(2), 701–715 (2015)

    Article  Google Scholar 

  26. Li, D., Zhan, R., Zheng, D., Li, M., Kaku, I.: A hybrid evolutionary hyper-heuristic approach for intercell scheduling considering transportation capacity. IEEE Trans. Autom. Sci. Eng 13(2), 1072–1089 (2016)

    Article  Google Scholar 

  27. Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. B Cybern. 26(1), 29–41 (1996)

    Article  Google Scholar 

  28. Kucukkoc, I., Zhang, D.Z.: Balancing of parallel U-shaped assembly lines. Comput. Oper. Res. 64, 233–244 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  29. Li, D., Li, M., Meng, X., Tian, Y.: A hyperheuristic approach for intercell scheduling with single processing machines and batch drocessing machines. IEEE Trans. Syst. Man Cybern. Syst. 45(2), 315–325 (2015)

    Article  Google Scholar 

  30. Xing, L.N., Chen, Y.W., Yang, K.W.: Multi-objective flexible job shop schedule: design and evaluation by simulation modeling. Appl. Soft Comput. 9, 362–376 (2009)

    Article  Google Scholar 

  31. Law, E.K.W., Yung, W.K.C.: Optimizing the smoothness of production lines with considerations of structural and dynamic complexities for electronics manufacturing. In: IEEE International Conference on Consumer Electronics-China. IEEE Xplore, 13 February 2017, INSPEC Accession Number: 16669831 (2017)

  32. Law, E.K.W., Yung, W.K.C.: Production line configuration and impact on complexities. Int. J. Technol. Eng. Stud. (IJTES) 3(4), 141–146 (2017)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Hong Kong Polytechnic University Faculty of Engineering, Kowloon, Hong Kong

    Edward Ko Wah Law & Winco Kam Chuen Yung

Authors
  1. Edward Ko Wah Law
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Winco Kam Chuen Yung
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Edward Ko Wah Law.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Law, E.K.W., Yung, W.K.C. Optimizing control dynamic complexity and production schedule. Int J Interact Des Manuf 13, 47–58 (2019). https://doi.org/10.1007/s12008-018-0488-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12008-018-0488-2

Keywords

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy