Two-agent single machine scheduling with forbidden intervals

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 var...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Applied Mathematics-A Journal of Chinese Universities 2015-03, Vol.30 (1), p.93-101
Hauptverfasser:	Feng, Qi, Li, Shi-sheng, Shang, Wei-ping
Format:	Artikel
Sprache:	eng
Schlagworte:	Applications of Mathematics Mathematics Mathematics and Statistics 伪多项式时间算法单机调度可恢复最小化概率目标函数
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.
ISSN:	1005-1031 1993-0445
DOI:	10.1007/s11766-015-3076-2