We consider the resumable version of the two-agent single machine scheduling prob- lems with forbidden intervals in which the jobs cannot be processed. The goal is to minimize the sum of the objective functions of the...We consider the resumable version of the two-agent single machine scheduling prob- lems 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.展开更多
基金Supported by National Natural Science Foundation of China(11401604,11401605,11271338,11326191)National Natural Science Foundation of Henan(132300410392)the Ph.D Programs Foundation of Ministry of Education of China(20111401110005)
文摘We consider the resumable version of the two-agent single machine scheduling prob- lems 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.
