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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Applied Mathematics-A Journal of Chinese Universities Ročník 30; číslo 1; s. 93 - 101
Hlavní autoři:	Feng, Qi, Li, Shi-sheng, Shang, Wei-ping
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Heidelberg Editorial Committee of Applied Mathematics - A Journal of Chinese Universities 01.03.2015
Témata:	Applications of Mathematics Mathematics Mathematics and Statistics forbidden interval dynamic programming 90C39 two-agent scheduling 90B36
ISSN:	1005-1031, 1993-0445
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	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