Sequential solutions in machine scheduling games

We consider the classical machine scheduling, where n jobs need to be scheduled on m machines, and where job j scheduled on machine i contributes p ij ∈ R to the load of machine i , with the goal of minimizing the makespan, i.e., the maximum load of any machine in the schedule. We study the ineffici...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of scheduling 2024-08, Vol.27 (4), p.363-373
Hauptverfasser:	Chen, Cong, Giessler, Paul, Mamageishvili, Akaki, Mihalák, Matúš, Penna, Paolo
Format:	Artikel
Sprache:	eng
Schlagworte:	Artificial Intelligence Business and Management Calculus of Variations and Optimal Control Optimization Decisions Equilibrium Operations Research/Decision Theory Optimization Schedules Scheduling Supply Chain Management
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!