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

Full description

Bibliographic Details

Published in:	Discrete Applied Mathematics Vol. 381; pp. 292 - 312
Main Authors:	Bergé, Pierre, Chaikovskaia, Mari, Gayon, Jean Philippe, Quilliot, Alain
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 15.03.2026
Subjects:	Approximation algorithm Reconfigurable resources Scheduling Approximation algorithm Scheduling Reconfigurable resources
ISSN:	0166-218X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!