Single machine scheduling with two competing agents and equal job processing times

•The paper studies two agent scheduling models with unit processing times.•We provide comprehensive complexity results for many min-max and min-sum type scheduling objectives.•We provide polynomial and pseudo-polynomial time algorithms for the problems under consideration. We study various two-agent...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	European journal of operational research Ročník 244; číslo 1; s. 86 - 99
Hlavní autoři:	Oron, Daniel, Shabtay, Dvir, Steiner, George
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 01.07.2015 Elsevier Sequoia S.A
Témata:	Agency theory Algorithms Completion time Complexity Computation Equal processing times Job shops Mathematical analysis Mathematical models Mathematical problems Operational research Operations research Optimization Optimization algorithms Polynomials Production scheduling Scheduling Single machine scheduling Studies Two competing agents Equal processing times Two competing agents Single machine scheduling Complexity
ISSN:	0377-2217, 1872-6860
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!

Buďte první, kdo okomentuje tento záznam!