Two-agent scheduling to minimize the total cost

► We consider a two-agent single-machine scheduling problem to minimize the total costs of the agents. ► The cost of the first agent is the maximum weighted completion time of his jobs and the cost of the second agent is the total weighted completion time of his jobs. ► We provide a 2-approximation...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	European journal of operational research Ročník 215; číslo 1; s. 39 - 44
Hlavní autoři:	Nong, Q.Q., Cheng, T.C.E., Ng, C.T.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 16.11.2011 Elsevier Elsevier Sequoia S.A
Edice:	European Journal of Operational Research
Témata:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Approximation Approximation algorithm Artificial intelligence Completion time Computer science; control theory; systems Cost engineering Exact sciences and technology Inventory control, production control. Distribution Mathematical analysis Multi-agent Operational research Operational research and scientific management Operational research. Management science Operations research Polynomial time approximation scheme Production scheduling Resource scheduling Scheduling Scheduling algorithms Scheduling Multi-agent Approximation algorithm Polynomial time approximation scheme Scheduling, sequencing Studies Theoretical computing Multi-agent Polynomial time approximation scheme Scheduling Approximation algorithm Costs Polynomial approximation Makespan Polynomial time Multiagent system NP hard problem Artificial intelligence Completion time Execution time
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!