Abstract
This research focuses on a parallel machines scheduling problem considering lot streaming which is similar to the traditional hybrid flow shop scheduling (HFS). In a typical HFS with parallel machines problem, the allocation of machine resources for each order should be determined in advance. In addition, the size of each sublot is splited by parallel machines configuration. However, allocation of machine resources, sublot size and lot sequence are highly mutual influence. If allocation of machine resources has been determined, adjustment on production sequence is unable to reduce production makespan. Without splitting a given job into sublots, the production scheduling cannot have overlapping of successive operations in multi-stage parallel machines environment thereby contributing to the best production scheduling. Therefore, this research motivated from a solar cell industry is going to explore these issues. The multi-stage and parallel-machines scheduling problem in the solar cell industry simultaneously considers the optimal sublot size, sublot sequence, parallel machines sublot scheduling and machine configurations through dynamically allocating all sublot to parallel machines. We formulate this problem as a mixed integer linear programming (MILP) model considering the practical characteristics including parallel machines, dedicated machines, sequence-independent setup time, and sequence-dependent setup time. A hybrid-coded particle swarm optimization (HCPSO) is developed to find a near-optimal solution. At the end of this study, the result of this research will compare with the optimization method of mixed integer linear programming and case study.
Chapter PDF
Similar content being viewed by others
References
Salvador, M.S.: A solution to a special class of flow shop scheduling problems. In: Elmaghraby, S.E. (ed.) Symposium on the Theory of Scheduling and its Applications. LNEMS, vol. 86, pp. 83–91. Springer, Heidelberg (1973)
Salvador, M.S. (ed.): A solution to a special class of flow shop scheduling problems. Symposium on the theory of scheduling and its applications. Case Western Reserve University (1972)
Ruiz, R., Vázquez-Rodríguez, J.A.: The hybrid flow shop scheduling problem. European Journal of Operational Research 205(1), 1–18 (2010)
Chen, J., Lee, C.-Y.: General Multiprocessor Task Scheduling. Naval Research Logistics 64(1), 57–74 (1999)
Engin, O., Ceran, G., Yilmaz, M.K.: An efficient genetic algorithmnext term for previous termhybrid flow shop scheduling with multiprocessor task problemsnext term. Applied Soft Computing 11(3), 3056–3065 (2011)
Chuang, M.-C.: A genetic algorithm for multi-stage parallel machines scheduling problems – A case study for solar Cell industry. Tunghai University, Taichung (2011)
Ranga, V.R., Fu, H., Duncan, K.H.F., Jack, C.H.: Lot streaming in multistage production systems. International Journal of Production Economics 66(2), 199–211 (2000)
Zhang, W., Yin, C., Liu, J., Linn, R.J.: Multi-job lot streaming to minimize the mean completion time in m-1 hybrid flowshops. International Journal of Production Economics 96, 189–200 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 IFIP International Federation for Information Processing
About this paper
Cite this paper
Wang, HS., Wang, LC., Chen, TL., Chen, YY., Cheng, CY. (2013). Multi-stage Parallel Machines and Lot-Streaming Scheduling Problems – A Case Study for Solar Cell Industry. In: Prabhu, V., Taisch, M., Kiritsis, D. (eds) Advances in Production Management Systems. Sustainable Production and Service Supply Chains. APMS 2013. IFIP Advances in Information and Communication Technology, vol 414. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41266-0_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-41266-0_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41265-3
Online ISBN: 978-3-642-41266-0
eBook Packages: Computer ScienceComputer Science (R0)