This paper investigates semi-online scheduling on two uniform machines with the known largest size. Denote by s (j) the speed of each machine, j=1,2. Assume 0 < s (1)a parts per thousand currency signs (2), and let s=s (2)/s (1) be the speed ratio.
机构:
Shanghai Jiao Tong Univ, Antai Coll Econ & Management, Shanghai 200030, Peoples R ChinaHong Kong Polytech Univ, Dept Logist & Maritime Studies, Kowloon, Hong Kong, Peoples R China
Cao, Qian
Liu, Zhaohui
论文数: 0引用数: 0
h-index: 0
机构:
E China Univ Sci & Technol, Dept Math, Shanghai 200237, Peoples R ChinaHong Kong Polytech Univ, Dept Logist & Maritime Studies, Kowloon, Hong Kong, Peoples R China
Liu, Zhaohui
Cheng, T. C. E.
论文数: 0引用数: 0
h-index: 0
机构:
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