A Multi-stage and Parallel-Machine Scheduling Problem for Solar Cell Industry
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
- PDF / 120,767 Bytes
- 12 Pages / 439.37 x 666.142 pts Page_size
- 33 Downloads / 179 Views
A Multi-stage and Parallel-Machine Scheduling Problem for Solar Cell Industry Li-chih Wang, Chen-yang Cheng, Tzu-li Chen, Yin-yann Chen, and Chung-chun Wang
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. Keywords Hybrid flow shop scheduling • Genetic algorithm • Solar cell industry
Introduction Hybrid flow shop scheduling (HFS) was first proposed by Salvador (1973). Under this type of production environment, not only the process sequence of a job (also called work order) needs to be considered, dispatch problems, such as job allocation to machines, must also be considered, which increase the corresponding
L.-c. Wang (*) • C.-y. Cheng • C.-c. Wang Department of Industrial Engineering and Enterprise information, Tunghai University, Taichung 40704, Taiwan, ROC e-mail: [email protected] T.-l. Chen Department of Information Management, Fu Jen Catholic University, New Taipei City 24205, Taiwan, ROC Y.-y. Chen Department of Industrial Management, National Formosa University, Yunlin County 632, Taiwan, ROC R. Dou (ed.), Proceedings of 2012 3rd International Asia Conference on Industrial Engineering and Management Innovation(IEMI2012), DOI 10.1007/978-3-642-33012-4_21, # Springer-Verlag Berlin Heidelberg 2013
201
202
L.-c. Wang et al.
complexity (Salvador 1973; Ribas et al. 2010). Chen and Lee (1999) highlighted that past studies of HFS were commonly based on a one-job-on-one-machine type. However, their study was unable to run each job on multiple machines in simultaneous operation for industrial applications. Therefore, they proposed the so-called multiprocessor task scheduling architecture. Under the HFS production environment, the number of machine resources for each job had to be established or known and then the optimal multiprocessor task scheduling in each stage could be determined. Ribas et al. (2010) believed that in a production environment of this type, not only did the processing sequence require consideration, but the dispatch issue of how to allocate jobs to multiple machines should also be scrutinized. HFS problems have evolved from the earliest use of one-job-onone-machine to subsequent production environments with one-job-on-multiplemachines. However, the premise remains the same, namely that the machine resource allocation (or machine configuration) of each job must be established in advance b
Data Loading...
