Two-agent single machine scheduling with forbidden intervals

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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Applied Mathematics-A Journal of Chinese Universities Jg. 30; H. 1; S. 93 - 101
Hauptverfasser:	Feng, Qi, Li, Shi-sheng, Shang, Wei-ping
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Heidelberg Editorial Committee of Applied Mathematics - A Journal of Chinese Universities 01.03.2015
Schlagworte:	Applications of Mathematics Mathematics Mathematics and Statistics forbidden interval dynamic programming 90C39 two-agent scheduling 90B36
ISSN:	1005-1031, 1993-0445
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 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.
ISSN:	1005-1031 1993-0445
DOI:	10.1007/s11766-015-3076-2