We consider the resumable version of the two-agent single machine scheduling problems with forbidden intervals in which the jobs cannot be processed. The goal is to minimize the sum of the objective functions of the two agents. Polynomial and pseudo-polynomial time algorithms are presented for various combinations of regular scheduling objective functions.
机构:
Univ Warwick, Warwick Business Sch, Coventry CV4 7AL, W Midlands, EnglandUniv Siena, Dipartimento Ingn Informaz & Sci Matemat, Via Roma 56, I-53100 Siena, Italy
Chen, Bo
Nicosia, Gaia
论文数: 0引用数: 0
h-index: 0
机构:
Univ Roma Tre, Dipartimento Ingn, Via Vasca Navale 79, I-00146 Rome, ItalyUniv Siena, Dipartimento Ingn Informaz & Sci Matemat, Via Roma 56, I-53100 Siena, Italy
Nicosia, Gaia
Pacifici, Andrea
论文数: 0引用数: 0
h-index: 0
机构:
Univ Roma Tor Vergata, Dipartimento Ingn Civile & Ingn Informat, Via Politecn 1, I-00133 Rome, ItalyUniv Siena, Dipartimento Ingn Informaz & Sci Matemat, Via Roma 56, I-53100 Siena, Italy
机构:
Kang Ning Jr Coll, Dept Business Adm, Taipei, TaiwanYuanpei Univ, Dept Healthcare Management, Hsinchu, Taiwan
Wu, Wen-Hung
Yin, Yunqiang
论文数: 0引用数: 0
h-index: 0
机构:
E China Inst Technol, State Key Lab Breeding Base Nucl Resources & Envi, Nanchang 330013, Peoples R ChinaYuanpei Univ, Dept Healthcare Management, Hsinchu, Taiwan
机构:
Kang Ning Jr Coll, Dept Business Adm, Taipei, TaiwanE China Inst Technol, Sch Math & Informat Sci, Fuzhou 344000, Jiangxi, Peoples R China
Wu, Wen-Hung
论文数: 引用数:
h-index:
机构:
Chen, Juei-Chao
Yin, Yunqiang
论文数: 0引用数: 0
h-index: 0
机构:
E China Inst Technol, Sch Math & Informat Sci, Fuzhou 344000, Jiangxi, Peoples R ChinaE China Inst Technol, Sch Math & Informat Sci, Fuzhou 344000, Jiangxi, Peoples R China
Yin, Yunqiang
Wu, Wen-Hsiang
论文数: 0引用数: 0
h-index: 0
机构:
Yuanpei Univ, Dept Healthcare Management, Hsinchu, TaiwanE China Inst Technol, Sch Math & Informat Sci, Fuzhou 344000, Jiangxi, Peoples R China