Shih-Wei Lin

Prof. Shih-Wei Lin

Department of Information Management, Chang Gung University, Taoyuan 33302, Taiwan
orcid

Research Focus & Metrics

Academic Career Length

28Years (1999-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 November 2008 in Expert Systems with Applications
Verified
Journal Article
Closed access
Shih-Wei LinShih-Wei Lin
Shih-Wei Lin
Kuo-Ching YingKuo-Ching Ying
Kuo-Ching Ying
SCShih-Chieh Chen
Shih-Chieh Chen
ZLZne-Jung Lee
Zne-Jung Lee

1 September 2008 in Applied Soft Computing
Verified
Journal Article
Closed access
Shih-Wei LinShih-Wei Lin
Shih-Wei Lin
ZLZne-Jung Lee
Zne-Jung Lee
SCShih-Chieh Chen
Shih-Chieh Chen
TTTsung-Yuan Tseng
Tsung-Yuan Tseng

1 March 2010 in Computers & Industrial Engineering
Verified
Journal Article
Closed access
Vincent F. YuVincent F. Yu
Vincent F. Yu
Shih-Wei LinShih-Wei Lin
Shih-Wei Lin
WLWenyih Lee
Wenyih Lee
CTChing-Jung Ting
Ching-Jung Ting

10 June 2013 in International Journal of Production Research
Verified
Journal Article
Closed access
Shih-Wei LinShih-Wei Lin
Shih-Wei Lin
Kuo-Ching YingKuo-Ching Ying
Kuo-Ching Ying
CHChien-Yi Huang
Chien-Yi Huang
The distributed permutation flowshop scheduling problem (DPFSP) is a newly proposed topic in the shop scheduling field, which has important application in globalised and multi-plant environments. This study presents a modified iterated greedy (MIG) algorithm for this problem to minimise the maximum completion time among all the factories. Compared with previous approaches, the proposed algorithm is simpler yet more effective, more efficient, and more robust in solving the DPFSP. To validate the performance of the proposed MIG algorithm, computational experiments and comparisons are conducted on an extended benchmark problem set of Taillard. Despite its simplicity, the computational results show that the proposed MIG algorithm outperforms all existing algorithms, and the best-known solutions for almost half of instances are updated. This study can be offered as a contribution to the growing body of work on both theoretically and practically useful approaches to the DPFSP.

1 October 2012 in Applied Soft Computing
Verified
Journal Article
Closed access
Shih-Wei LinShih-Wei Lin
Shih-Wei Lin
Kuo-Ching YingKuo-Ching Ying
Kuo-Ching Ying
CLChou-Yuan Lee
Chou-Yuan Lee
ZLZne-Jung Lee
Zne-Jung Lee

1 February 2018 in Expert Systems with Applications
Verified
Journal Article
Closed access
Kuo-Ching YingKuo-Ching Ying
Kuo-Ching Ying
Shih-Wei LinShih-Wei Lin
Shih-Wei Lin