Shu-Hsing Chung
Shu-Hsing Chung has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
W. L. Pearn
Dept. of Ind. Eng. & Manage., Nat. Chiao Tung Univ., Hsinchu, Taiwan
2 shared publications- Amy Hsin-I Lee
Department of Industrial Management, Chung Hua University, Hsinchu, Taiwan
1 shared publication Chun-Mei Lai
Department of Industrial Engineering and Management, National Chiao Tung University, Taiwan, Republic of China
1 shared publication- Chun-Ying Huang
Department of Business Administration, Ching Yun University, Jungli, Taiwan, ROC
1 shared publication - Ming-Hsiu Hsieh
Department of Industrial Engineering and Management, National Chiao Tung University, Taiwan, ROC
1 shared publication W L Pearn
National Chiao Tung University Hsinchu ROC Taiwan
1 shared publication
Latest Publications
- 30 November 2010
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 59 (4) , 819-829
Interim equipment shutdown planning for a wafer fab during economic downturns
- 30 November 2010
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 59 (4) , 819-829
Interim equipment shutdown planning for a wafer fab during economic downturns
- 1 July 2009
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 60 (7) , 921-933
Fast and effective algorithms for the liquid crystal display module (LCM) scheduling problem with sequence-dependent setup time
Journal of the Operational Research Society (JORS) is the world's longest established OR journal and an official journal of The OR Society. It is the aim of the Journal to present papers which are relevant to practitioners, researchers, teachers, students and consumers of operational research, and which cover the theory, practice, history or methodology of OR.
- 1 July 2009
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 60 (7) , 921-933
Fast and effective algorithms for the liquid crystal display module (LCM) scheduling problem with sequence-dependent setup time
Journal of the Operational Research Society (JORS) is the world's longest established OR journal and an official journal of The OR Society. It is the aim of the Journal to present papers which are relevant to practitioners, researchers, teachers, students and consumers of operational research, and which cover the theory, practice, history or methodology of OR.
- 30 June 2009
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 47 (18) , 5109-5128
Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes
This paper considers the parallel batch processing machine scheduling problem which involves the constraints of unequal ready times, non-identical job sizes, and batch dependent processing times in order to sequence batches on identical parallel batch processing machines with capacity restrictions. This scheduling problem is a practical generalisation of the classical parallel batch processing machine scheduling problem, which has many real-world applications, particularly, in the aging test operation of the module assembly stage in the manufacture of thin film transistor liquid crystal displays (TFT-LCD). The objective of this paper is to seek a schedule with a minimum total completion time for the parallel batch processing machine scheduling problem. A mixed integer linear programming (MILP) model is proposed to optimise the scheduling problem. In addition, to solve the MILP model more efficiently, an effective compound algorithm is proposed to determine the number of batches and to apply this number as one parameter in the MILP model in order to reduce the complexity of the problem. Finally, three efficient heuristic algorithms for solving the large-scale parallel batch processing machine scheduling problem are also provided.
- 30 June 2009
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 47 (18) , 5109-5128
Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes
This paper considers the parallel batch processing machine scheduling problem which involves the constraints of unequal ready times, non-identical job sizes, and batch dependent processing times in order to sequence batches on identical parallel batch processing machines with capacity restrictions. This scheduling problem is a practical generalisation of the classical parallel batch processing machine scheduling problem, which has many real-world applications, particularly, in the aging test operation of the module assembly stage in the manufacture of thin film transistor liquid crystal displays (TFT-LCD). The objective of this paper is to seek a schedule with a minimum total completion time for the parallel batch processing machine scheduling problem. A mixed integer linear programming (MILP) model is proposed to optimise the scheduling problem. In addition, to solve the MILP model more efficiently, an effective compound algorithm is proposed to determine the number of batches and to apply this number as one parameter in the MILP model in order to reduce the complexity of the problem. Finally, three efficient heuristic algorithms for solving the large-scale parallel batch processing machine scheduling problem are also provided.
- 2 June 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Electronics Packaging Manufacturing
- Vol. 32 (3) , 185-197
An Effective Scheduling Approach for Maximizing Polyimide Printing Weighted Throughput in Cell Assembly Factories
Polyimide printing (PI) is an important process operation but also often the cause of bottlenecks in capital-intensive cell assembly factories. Therefore, the development of an effective scheduling method to maximize throughput in this PI process is essential and difficult. In the polyimide printing scheduling problem (PISP), jobs are given weights and clustered by their product types, which must be processed on identical parallel PI machines. The setup times for two consecutive jobs between different product types in the PI machines are sequence-dependent. In this paper, the PISP is formulated as a mixed integer linear programming model. The PISP is also transformed into a multiple tour maximum collection problem (MTMCP), a well-known network problem which has been investigated extensively. Based on this transformation, one can therefore solve the PISP near-optimally using the efficient algorithm.
- 2 June 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Electronics Packaging Manufacturing
- Vol. 32 (3) , 185-197
An Effective Scheduling Approach for Maximizing Polyimide Printing Weighted Throughput in Cell Assembly Factories
Polyimide printing (PI) is an important process operation but also often the cause of bottlenecks in capital-intensive cell assembly factories. Therefore, the development of an effective scheduling method to maximize throughput in this PI process is essential and difficult. In the polyimide printing scheduling problem (PISP), jobs are given weights and clustered by their product types, which must be processed on identical parallel PI machines. The setup times for two consecutive jobs between different product types in the PI machines are sequence-dependent. In this paper, the PISP is formulated as a mixed integer linear programming model. The PISP is also transformed into a multiple tour maximum collection problem (MTMCP), a well-known network problem which has been investigated extensively. Based on this transformation, one can therefore solve the PISP near-optimally using the efficient algorithm.
- 1 June 2007
- Published by Springer Nature in OR Spectrum
- Vol. 30 (3) , 431-452
Heuristic algorithms to solve the capacity allocation problem in photolithography area (CAPPA)
- 1 June 2007
- Published by Springer Nature in OR Spectrum
- Vol. 30 (3) , 431-452
Heuristic algorithms to solve the capacity allocation problem in photolithography area (CAPPA)
- 22 March 2006
- Published by Springer Nature in The International Journal of Advanced Manufacturing Technology
- Vol. 31 (9-10) , 957-968
A comparison of two methods for transforming non-normal manufacturing data
- 22 March 2006
- Published by Springer Nature in The International Journal of Advanced Manufacturing Technology
- Vol. 31 (9-10) , 957-968
A comparison of two methods for transforming non-normal manufacturing data
- 10 January 2006
- Published by Springer Nature in The International Journal of Advanced Manufacturing Technology
- Vol. 31 (3-4) , 316-327
Job releasing and throughput planning for wafer fabrication under demand fluctuating make-to-stock environment
- 10 January 2006
- Published by Springer Nature in The International Journal of Advanced Manufacturing Technology
- Vol. 31 (3-4) , 316-327
Job releasing and throughput planning for wafer fabrication under demand fluctuating make-to-stock environment