Cumulative scheduling with variable task profiles and concave piecewise linear processing rate functionsReportar como inadecuado




Cumulative scheduling with variable task profiles and concave piecewise linear processing rate functions - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

1 LAAS-ROC - Équipe Recherche Opérationnelle, Optimisation Combinatoire et Contraintes LAAS - Laboratoire d-analyse et d-architecture des systèmes Toulouse

Abstract : We consider a cumulative scheduling problem where a task duration and resource consumption are not fixed. The consumption profile of the task, which can vary continuously over time, is a decision variable of the problem to be determined and a task is completed as soon as the integration over its time window of a non-decreasing and continuous processing rate function of the consumption profile has reached a predefined amount of energy. The goal is to find a feasible schedule, which is an NP-hard problem. For the case where functions are concave and piecewise linear, we present two propagation algorithms. The first one is the adaptation to concave functions of the variant of the energetic reasoning previously established for linear functions. Furthermore, a full characterization of the relevant intervals for time-window adjustments is provided. The second algorithm combines a flow-based checker with time-bound adjustments derived from the timetable disjunctive reasoning for the cumulative constraint. Complementarity of the algorithms is assessed via their integration in a hybrid branch-and-bound and computational experiments on small-size instances.

Keywords : energy constraints energetic reasoning continuous scheduling continuous resources concave piece-wise linear functions





Autor: Margaux Nattaf - Christian Artigues - Pierre Lopez -

Fuente: https://hal.archives-ouvertes.fr/



DESCARGAR PDF




Documentos relacionados