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...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete Applied Mathematics Ročník 381; s. 292 - 312
Hlavní autori:	Bergé, Pierre, Chaikovskaia, Mari, Gayon, Jean Philippe, Quilliot, Alain
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 15.03.2026
Predmet:	Approximation algorithm Reconfigurable resources Scheduling Approximation algorithm Scheduling Reconfigurable resources
ISSN:	0166-218X
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!