Skip to main content

Dynamic Hoist Scheduling Problem on Real-Life Electroplating Production Line

  • Chapter
  • First Online:
Electrical Engineering and Applied Computing

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 90))

  • 1426 Accesses

Abstract

The paper describes a conducted research in order to create the scheduling system for electroplating lines. We are interested in an order driven production organization. This type of production requires scheduling in the real-time. In order to avoid costly scheduling, before the real-time system starts we prepare a set of production scenarios. We use recognition methods to select the most appropriate scenario. Selected scenarios are parameters to a heuristic scheduling algorithm called cyclogram unfolding. We present the short problem notion and algorithm steps. The real-life production line located at Wroc?aw, Poland is used to explain the algorithm step by step. We analyze the results for historical runs and generated problems. The utilization ratio is introduced in order to judge the quality of created schedules.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Frohlich R, Steneberg SC (2009) Optimal cyclic multiple hoist scheduling for processes with loops and parallel resources. IEEE Int Conf Syst Man Cybern, SMC 2009

    Google Scholar 

  2. Hindi KS, Fleszar K (2004) A constraint propagation heuristic for the single-hoist, multiple-products scheduling problem. Comput Ind Eng 47(1):91–101

    Article  Google Scholar 

  3. Jégou D, Kim DW (2006) A contract net based intelligent agent system for solving the reactive hoist scheduling problem. Expert Syst Appl 30(2):156–167

    Article  Google Scholar 

  4. Jiyin L, Yun J (2002) Cyclic scheduling of a single hoist in extended electroplating lines: a comprehensive integer programming solution. IIE Trans 34(10):905

    Google Scholar 

  5. Kujawski K (2006) Zagadnienie optymalizacji dzia?ania wybranych linii produkcyjnych. Wydzia? Informatyki i Zarz?dzania. Wroc?aw, Polska, Politechnka Wroc?awska. Mgr in?.: 79

    Google Scholar 

  6. Kujawski K, ?wi?tek J (2009) Using cyclogram unfolding in dynamic hoist scheduling problem. In: Proceedings of the international conference on systems engineering ICSE’09

    Google Scholar 

  7. Kujawski K, ?wi?tek J (2010) Intelligent scenario selection in dynamic hoist scheduling problem: the real-life electroplating production line case analysis. Lecture notes in engineering and computer science: proceedings of the world congress on engineering 2010, WCE 2010, 30 June–2 July, 2010, London, UK

    Google Scholar 

  8. Lamothe J, Correge M, et al (1995) A dynamic heuristic for the real time hoist scheduling problem. In: Proceedings of ETFA ‘95, Symposium on emerging technologies and factory automation 1995, INRIA/IEEE 1995

    Google Scholar 

  9. Lamothe J, Thierry C et al (1996) A multihoist model for the real time hoist scheduling problem. Engineering in Systems Application Multiconference, Lille 461–466

    Google Scholar 

  10. Leung J, Guoqing Z (2003) Optimal cyclic scheduling for printed circuit board production lines with multiple hoists and general processing sequence. IEEE Trans Robot Autom 19(3):480–484

    Article  Google Scholar 

  11. Levner E, Kats V et al (2010) Complexity of cyclic scheduling problems: a state-of-the-art survey. Comput Ind Eng 59(2): 352–361

    Article  Google Scholar 

  12. Mak RWT, Gupta SM et al (2002) Modeling of material handling hoist operations in a PCB manufacturing facility. J Electr Manuf 11(1):33

    Article  Google Scholar 

  13. Phillips LW, Unger PS (1976) Mathematical programming solution of a hoist scheduling program. AIIE Trans 8(2):219–225

    Article  Google Scholar 

  14. Yan PC, Chu et al (2008) An algorithm for optimal cyclic scheduling in a robotic cell with flexible processing times. IEEE Int Conf Ind Eng Eng Manag, IEEM 2008

    Google Scholar 

  15. Zhou Z, Liu J (2008) A heuristic algorithm for the two-hoist cyclic scheduling problem with overlapping hoist coverage ranges. IIE Trans 40(8):782–794

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Krzysztof Kujawski .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media B.V.

About this chapter

Cite this chapter

Kujawski, K., Świątek, J. (2011). Dynamic Hoist Scheduling Problem on Real-Life Electroplating Production Line. In: Ao, SI., Gelman, L. (eds) Electrical Engineering and Applied Computing. Lecture Notes in Electrical Engineering, vol 90. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-1192-1_46

Download citation

  • DOI: https://doi.org/10.1007/978-94-007-1192-1_46

  • Published:

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-007-1191-4

  • Online ISBN: 978-94-007-1192-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics