Kód: 07062817
In a scheduling problem than considers identical machines, the job assignments can become pretty challenging, given that these jobs require the least time in their waiting line and at the same time, the total completion of the job ... celý popis
Angličtina
69.05 €
Bežne: 71.87 €
Ušetríte 2.82 €

Nákupom získate 167 bodov
Anotácia knihy
In a scheduling problem than considers identical machines, the job assignments can become pretty challenging, given that these jobs require the least time in their waiting line and at the same time, the total completion of the jobs need to finish as soon as possible. This is a why a bi-objective optimization problem is approached, where both makespan and total flow time need to be minimized. A mechanism proposed to solve this problem with a setting of a 2-player non-cooperative game, under tht framework of a 2x2 non-zero sum matrix; where each player aims for a different objective suggested in the scheduling problem. The scenario implied each job behaving selfishly and attempting to move to a previous position in the machine, which generated a cost for the job agent, who is attempting to minimize the total flow time; while a controlling agent is in charge of assigning the jobs to the machines in order to minimize the total completion time or makespan. As a result of the dynamic trade-offs between the agents in the repeated game, a Pareto Front set of points is obtained.
Parametre knihy
69.05 €
AngličtinaOsobný odber Bratislava a 12742 dalších
Copyright ©2008-26 najlacnejsie-knihy.sk Všetky práva vyhradenéSúkromieCookies
24 miliónov titulov
Vrátenie do mesiaca
02/210 210 99 (8-15.30h)Nákupný košík ( prázdny )