In this paper we investigate the following scheduling problem: We have two sets of identical machines, the jobs have two processing times one for each set of machines. We consider two different objective functions, in the first model the goal is to minimize the maximum of the makespans on the sets, in the second model we minimize the sum of the makespans. We consider the online, semi online and offline versions of these problems.
机构:
Shanghai Jiao Tong Univ, Antai Coll Econ & Management, Shanghai 200030, Peoples R ChinaShanghai Jiao Tong Univ, Antai Coll Econ & Management, Shanghai 200030, Peoples R China
Cao, Qian
Cheng, T. C. E.
论文数: 0引用数: 0
h-index: 0
机构:
Hong Kong Polytech Univ, Dept Logist & Maritime Studies, Kowloon, Hong Kong, Peoples R ChinaShanghai Jiao Tong Univ, Antai Coll Econ & Management, Shanghai 200030, Peoples R China
Cheng, T. C. E.
Wan, Guohua
论文数: 0引用数: 0
h-index: 0
机构:
Shanghai Jiao Tong Univ, Antai Coll Econ & Management, Shanghai 200030, Peoples R ChinaShanghai Jiao Tong Univ, Antai Coll Econ & Management, Shanghai 200030, Peoples R China
Wan, Guohua
Li, Yi
论文数: 0引用数: 0
h-index: 0
机构:
Shanghai Jiao Tong Univ, Antai Coll Econ & Management, Shanghai 200030, Peoples R ChinaShanghai Jiao Tong Univ, Antai Coll Econ & Management, Shanghai 200030, Peoples R China