Approximation algorithms for demand-based job scheduling with reconfigurable resources

We consider a scheduling problem with reconfigurable resources. Several types of jobs (e.g. transportation tasks, production operations) have to be processed by a set of identical resources (e.g. robots, workers, processors) over a discrete time horizon. In each time period, teams of resources must...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete Applied Mathematics Jg. 381; S. 292 - 312
Hauptverfasser:	Bergé, Pierre, Chaikovskaia, Mari, Gayon, Jean Philippe, Quilliot, Alain
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 15.03.2026
Schlagworte:	Approximation algorithm Reconfigurable resources Scheduling Approximation algorithm Scheduling Reconfigurable resources
ISSN:	0166-218X
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!