This paper addresses flow shop scheduling problems with sum-of-logarithm-processing-times-based learning effects. The objective is to minimize the total completion time, the makespan, the total weighted completion time, and the sum of the quadratic job completion times, respectively. Heuristic algorithms based on the optimal schedules for the corresponding flow shop scheduling problems are presented and their worst-case error bounds are also analyzed.
机构:
Hong Kong Polytech Univ, Dept Logist & Maritime Studies, Kowloon, Hong Kong, Peoples R ChinaHong Kong Polytech Univ, Dept Logist & Maritime Studies, Kowloon, Hong Kong, Peoples R China
Cheng, T. C. E.
Lai, Peng-Jen
论文数: 0引用数: 0
h-index: 0
机构:
Natl Kaohsiung Normal Univ, Dept Math, Kaohsiung, TaiwanHong Kong Polytech Univ, Dept Logist & Maritime Studies, Kowloon, Hong Kong, Peoples R China
Lai, Peng-Jen
Wu, Chin-Chia
论文数: 0引用数: 0
h-index: 0
机构:
Feng Chia Univ, Dept Stat, Taichung 40724, TaiwanHong Kong Polytech Univ, Dept Logist & Maritime Studies, Kowloon, Hong Kong, Peoples R China
Wu, Chin-Chia
Lee, Wen-Chiung
论文数: 0引用数: 0
h-index: 0
机构:
Feng Chia Univ, Dept Stat, Taichung 40724, TaiwanHong Kong Polytech Univ, Dept Logist & Maritime Studies, Kowloon, Hong Kong, Peoples R China
机构:
Hong Kong Polytech Univ, Dept Logist & Maritime Studies, Kowloon, Hong Kong, Peoples R ChinaHong Kong Polytech Univ, Dept Logist & Maritime Studies, Kowloon, Hong Kong, Peoples R China
Cheng, T. C. E.
Lai, Peng-Jen
论文数: 0引用数: 0
h-index: 0
机构:
Natl Kaohsiung Normal Univ, Dept Math, Kaohsiung, TaiwanHong Kong Polytech Univ, Dept Logist & Maritime Studies, Kowloon, Hong Kong, Peoples R China
Lai, Peng-Jen
Wu, Chin-Chia
论文数: 0引用数: 0
h-index: 0
机构:
Feng Chia Univ, Dept Stat, Taichung 40724, TaiwanHong Kong Polytech Univ, Dept Logist & Maritime Studies, Kowloon, Hong Kong, Peoples R China
Wu, Chin-Chia
Lee, Wen-Chiung
论文数: 0引用数: 0
h-index: 0
机构:
Feng Chia Univ, Dept Stat, Taichung 40724, TaiwanHong Kong Polytech Univ, Dept Logist & Maritime Studies, Kowloon, Hong Kong, Peoples R China