Game Theoretic Approaches to Parallel Machine Scheduling: A bi-objective optimization problem viewed as a non-cooperative game of two players - Couverture souple

Ramirez Rios, Diana; Rodriguez Pinto, Claudia; Paternina-Arboleda, Carlos

 
9783659252525: Game Theoretic Approaches to Parallel Machine Scheduling: A bi-objective optimization problem viewed as a non-cooperative game of two players
Couverture souple
ISBN 10 : 3659252522 ISBN 13 : 9783659252525
Editeur : LAP LAMBERT Academic Publishing, 2012

Synopsis

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.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

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.

Biographie de l'auteur

Industrial Engineer with a Masters in Industrial Engineering at Universidad del Norte, Barranquilla, Colombia. Scientific director of Research Center FCIMEC and professor of Universidad de la Costa and Universidad Simón Bolívar. Her research interests are in optimization of productive and logistic systems, game theory and stochastic processes.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Éditeur
LAP LAMBERT Academic Publishing
Date d'édition
2012
Langue
anglais
ISBN 10 
3659252522
ISBN 13 
9783659252525
Reliure
Broché
Nombre de pages
176
Coordonnées du fabricant
non disponible
Personne responsable
KreGa Onlinehandel GmbH
4950000000000
info@krega-onlinehandel.de

Birkenweg 31
Brakel
33034
Allemagne