Skip to main content
  • 2656 Accesses

Abstract

This paper studies a multi-stage and parallel-machines scheduling problem which is similar to the traditional hybrid flow shop scheduling (HFS) in the solar cell industry. The multi-stage and parallel-machines scheduling problem in the solar cell industry simultaneously determines the optimal production sequence, multiprocessor task scheduling and machine configurations through dynamically allocating all jobs to multiple machines. We formulate this problem as a mixed integer linear programming model considering the practical characteristics and constraints. A hybrid-coded genetic algorithm is developed to find a near-optimal solution. Preliminary computational study indicates that the developed algorithm not only provides good quality solutions.

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Allahverdi A, Mittenthal J (1994) Scheduling on M parallel machines subject to random breakdowns to minimize expected mean flow time. Nav Res Logist 41(5):677–682

    Article  Google Scholar 

  • Chen J, Lee CY (1999) General multiprocessor task scheduling. Nav Res Logist 46(1):57–74

    Article  Google Scholar 

  • Engin O, Ceran G, Yilmaz MK (2011) An efficient genetic algorithm for hybrid flow shop scheduling with multiprocessor task problems. Appl Soft Comput 11(3):3056–3065

    Article  Google Scholar 

  • Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. San Francisco W.H. Freeman & Co. New York, USA © 1990

    Google Scholar 

  • Jin ZH, Ohno K, Ito T, Elmaghraby SE (2002) Scheduling hybrid flow shops in printed circuit board assembly lines. Prod Oper Manag 11(2):216–230

    Article  Google Scholar 

  • Ribas I, Leisten R, Framin JM (2010) Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective. Comput Oper Res 37:1439–1454

    Article  Google Scholar 

  • Ruiz R, Vázquez-Rodríguez JA (2010) Invited review. The hybrid flow shop scheduling problem. Eur J Oper Res 205(1):1–18

    Article  Google Scholar 

  • Salvador MS (1973) A solution to a special class of flow shop scheduling problems. In: Elmaghraby SE (ed) Symposium on the theory of scheduling and its applications. Springer, Berlin, pp 83–91

    Google Scholar 

Download references

Acknowledgment

The authors gratefully acknowledge the National Science Council, Taiwan, R.O.C., for support under contract NSC 98-2221-E-029-018-MY3 and NSC 100-2221-E-029-011.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Li-chih Wang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, Lc., Cheng, Cy., Chen, Tl., Chen, Yy., Wang, Cc. (2013). A Multi-stage and Parallel-Machine Scheduling Problem for Solar Cell Industry. In: Dou, R. (eds) Proceedings of 2012 3rd International Asia Conference on Industrial Engineering and Management Innovation (IEMI2012). Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33012-4_21

Download citation

Publish with us

Policies and ethics