Suh-Jenq Yang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Suh-Jenq Yang has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Dar-Li Yang
Department of Information Management, National Formosa University, Yun-Lin 632, Taiwan
10 shared publications Chou-Jung Hsu
4 shared publicationsHsin-Tao Lee
Department of Industrial Management, Nan Kai University of Technology, Nan-Tou, Taiwan
4 shared publicationsTeng-Ruey Chang
Department of Industrial Engineering and Management , Nan Kai University of Technology , Nan-Tou , Taiwan 542 , Republic of China
2 shared publicationsJia-Yuarn Guo
Department of Industrial Management, Nan Kai University of Technology, Nan-Tou, Taiwan
1 shared publication
Latest Publications
- 1 March 2014
- Published by Elsevier in Information Sciences
- Vol. 260, 215-217
Note on “Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time”
- 1 March 2014
- Published by Elsevier in Information Sciences
- Vol. 260, 215-217
Note on “Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time”
- 27 January 2013
- Published by Springer Nature in The International Journal of Advanced Manufacturing Technology
- Vol. 67 (1-4) , 181-188
Multiple common due dates assignment and scheduling problems with resource allocation and general position-dependent deterioration effect
- 27 January 2013
- Published by Springer Nature in The International Journal of Advanced Manufacturing Technology
- Vol. 67 (1-4) , 181-188
Multiple common due dates assignment and scheduling problems with resource allocation and general position-dependent deterioration effect
- 8 November 2012
- Published by Taylor & Francis in Journal of the Chinese Institute of Industrial Engineers
- Vol. 29 (8) , 534-543
Parallel machines scheduling with deterioration effects and resource allocations
This article studies multi-objective scheduling problems involving deterioration effects and resource allocations simultaneously on an unrelated parallel-machine setting. The linear and convex resource consumption models are examined, respectively. We aim to find the optimal resource allocation and the optimal job sequence to minimize the cost function including the total completion time, the total machine load, the total absolute differences in completion times and the resource allocation and the cost function including the total waiting time, the total absolute differences in waiting times, and the resource allocation, respectively. We develop polynomial time algorithms for all the problems studied.
- 8 November 2012
- Published by Taylor & Francis in Journal of the Chinese Institute of Industrial Engineers
- Vol. 29 (8) , 534-543
Parallel machines scheduling with deterioration effects and resource allocations
This article studies multi-objective scheduling problems involving deterioration effects and resource allocations simultaneously on an unrelated parallel-machine setting. The linear and convex resource consumption models are examined, respectively. We aim to find the optimal resource allocation and the optimal job sequence to minimize the cost function including the total completion time, the total machine load, the total absolute differences in completion times and the resource allocation and the cost function including the total waiting time, the total absolute differences in waiting times, and the resource allocation, respectively. We develop polynomial time algorithms for all the problems studied.
- 29 May 2012
- Published by Taylor & Francis in Journal of the Chinese Institute of Industrial Engineers
- Vol. 29 (4) , 282-289
Unrelated parallel-machine scheduling simultaneously with rate-modifying activities and earliness and tardiness penalties
In this paper, we consider a scheduling problem simultaneously with rate-modifying activities and earliness and tardiness penalties on an unrelated parallel-machine setting. We assume that each machine has at most one rate-modifying activity to improve its production efficiency during the scheduling horizon and all the jobs have a common due-date. The objective is to determine jointly the optimal positions of rate-modifying activities, the optimal common due-date of all jobs, and the optimal schedule to minimize the sum of earliness and tardiness costs. We show that the problem can be optimally solved in polynomial time. 本研究探討具維修及提早完工與延遲完工懲罰之非相關平行機台(unrelated parallel-machine)生產排程問題。 本研究假設所有工作具有一個共同之交貨時間點(common due-date) , 且每一台機器在加工過程中均可至多執行維修(rate-modifying activity)一次 , 以改善其生產效率。 本研究之目的在尋找最佳維修位置、 最佳共同交貨時間點及最佳工作排序 , 使得提早完工懲罰與延遲完工懲罰之總合為最低。 本研究證明所探討之問題能以多項式時間演算法(polynomial time algorithm)求解。
- 29 May 2012
- Published by Taylor & Francis in Journal of the Chinese Institute of Industrial Engineers
- Vol. 29 (4) , 282-289
Unrelated parallel-machine scheduling simultaneously with rate-modifying activities and earliness and tardiness penalties
In this paper, we consider a scheduling problem simultaneously with rate-modifying activities and earliness and tardiness penalties on an unrelated parallel-machine setting. We assume that each machine has at most one rate-modifying activity to improve its production efficiency during the scheduling horizon and all the jobs have a common due-date. The objective is to determine jointly the optimal positions of rate-modifying activities, the optimal common due-date of all jobs, and the optimal schedule to minimize the sum of earliness and tardiness costs. We show that the problem can be optimally solved in polynomial time. 本研究探討具維修及提早完工與延遲完工懲罰之非相關平行機台(unrelated parallel-machine)生產排程問題。 本研究假設所有工作具有一個共同之交貨時間點(common due-date) , 且每一台機器在加工過程中均可至多執行維修(rate-modifying activity)一次 , 以改善其生產效率。 本研究之目的在尋找最佳維修位置、 最佳共同交貨時間點及最佳工作排序 , 使得提早完工懲罰與延遲完工懲罰之總合為最低。 本研究證明所探討之問題能以多項式時間演算法(polynomial time algorithm)求解。
- 29 February 2012
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 62 (1) , 271-275
Single-machine scheduling problems simultaneously with deterioration and learning effects under deteriorating multi-maintenance activities consideration
- 29 February 2012
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 62 (1) , 271-275
Single-machine scheduling problems simultaneously with deterioration and learning effects under deteriorating multi-maintenance activities consideration
- 1 December 2011
- Published by Taylor & Francis in Journal of the Chinese Institute of Industrial Engineers
- Vol. 28 (8) , 597-605
Single-machine scheduling with joint deterioration and learning effects under group technology and group availability assumptions
The goal of group technology in manufacturing process is to identify a set of products with similar processing requirements and minimize machine changeover and setup. Although different models of joint deterioration and learning effects have been extensively studied in various areas, it has rarely been studied in the context of group scheduling. In this article, we consider single-machine scheduling problems involving deterioration and learning effects simultaneously under the group technology and the group availability assumptions. We assume that the group setup time is a function of position-dependent learning while the actual processing time of a job is a function of joint time-dependent deterioration and position-dependent learning. We further assume that after the setup, the machine deterioration will reset first and then starts anew. We prove that the makespan and the total completion time minimization problems can be optimally solved in polynomial time algorithms with agreeable conditions.
- 1 December 2011
- Published by Taylor & Francis in Journal of the Chinese Institute of Industrial Engineers
- Vol. 28 (8) , 597-605
Single-machine scheduling with joint deterioration and learning effects under group technology and group availability assumptions
The goal of group technology in manufacturing process is to identify a set of products with similar processing requirements and minimize machine changeover and setup. Although different models of joint deterioration and learning effects have been extensively studied in various areas, it has rarely been studied in the context of group scheduling. In this article, we consider single-machine scheduling problems involving deterioration and learning effects simultaneously under the group technology and the group availability assumptions. We assume that the group setup time is a function of position-dependent learning while the actual processing time of a job is a function of joint time-dependent deterioration and position-dependent learning. We further assume that after the setup, the machine deterioration will reset first and then starts anew. We prove that the makespan and the total completion time minimization problems can be optimally solved in polynomial time algorithms with agreeable conditions.
- 1 August 2011
- Published by Elsevier in Applied Mathematical Modelling
- Vol. 35 (8) , 4008-4016
Group scheduling problems with simultaneous considerations of learning and deterioration effects on a single-machine
- 1 August 2011
- Published by Elsevier in Applied Mathematical Modelling
- Vol. 35 (8) , 4008-4016
Group scheduling problems with simultaneous considerations of learning and deterioration effects on a single-machine
- 27 May 2011
- Published by Taylor & Francis in Journal of the Chinese Institute of Industrial Engineers
- Vol. 28 (4) , 270-280
Parallel machines scheduling with simultaneous considerations of position-dependent deterioration effects and maintenance activities
This article considers identical parallel-machine scheduling problems with simultaneous considerations of position-dependent deterioration effects and maintenance activities. To counteract the deterioration effects on the machines, we assume that each machine must be maintained exactly once during the planning horizon and the maintenance can be scheduled immediately after completing the processing of any job. We further assume that, after the maintenance on a machine, the machine reverts to its initial condition and the deterioration effect starts anew. The objective is to find jointly the optimal maintenance positions and the optimal job sequences to minimize the total machine load. We provide polynomial time solutions for all the problems studied. Furthermore, we also show that the problem under study remains polynomially solvable when each machine is subject to multiple maintenance activities.
- 27 May 2011
- Published by Taylor & Francis in Journal of the Chinese Institute of Industrial Engineers
- Vol. 28 (4) , 270-280
Parallel machines scheduling with simultaneous considerations of position-dependent deterioration effects and maintenance activities
This article considers identical parallel-machine scheduling problems with simultaneous considerations of position-dependent deterioration effects and maintenance activities. To counteract the deterioration effects on the machines, we assume that each machine must be maintained exactly once during the planning horizon and the maintenance can be scheduled immediately after completing the processing of any job. We further assume that, after the maintenance on a machine, the machine reverts to its initial condition and the deterioration effect starts anew. The objective is to find jointly the optimal maintenance positions and the optimal job sequences to minimize the total machine load. We provide polynomial time solutions for all the problems studied. Furthermore, we also show that the problem under study remains polynomially solvable when each machine is subject to multiple maintenance activities.