%0 Conference Proceedings
%T Multi-stage Parallel Machines and Lot-Streaming Scheduling Problems – A Case Study for Solar Cell Industry
%+ Tunghai University [Taichung]
%+ Fu Jen Catholic University
%+ National Formosa University
%A Wang, Hi-Shih
%A Wang, Li-Chih
%A Chen, Tzu-Li
%A Chen, Yin-Yann
%A Cheng, Chen-Yang
%Z Part 1: Sustainable Production
%< avec comité de lecture
%( IFIP Advances in Information and Communication Technology
%B 20th Advances in Production Management Systems (APMS)
%C State College, PA, United States
%Y Vittal Prabhu
%Y Marco Taisch
%Y Dimitris Kiritsis
%I Springer
%3 Advances in Production Management Systems. Sustainable Production and Service Supply Chains
%V AICT-414
%N Part I
%P 151-158
%8 2013-09-09
%D 2013
%R 10.1007/978-3-642-41266-0_19
%K Hybrid flow shop scheduling
%K particle swarm optimization
%K solar cell industry
%K lot streaming
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 5
%Z WG 5.7
%2 https://inria.hal.science/hal-01452307/document
%2 https://inria.hal.science/hal-01452307/file/978-3-642-41266-0_19_Chapter.pdf
%L hal-01452307
%U https://inria.hal.science/hal-01452307
%~ IFIP
%~ IFIP-AICT
%~ IFIP-TC
%~ IFIP-TC5
%~ IFIP-WG
%~ IFIP-WG5-7
%~ IFIP-AICT-414