Cumulative scheduling with variable task profiles and concave piecewise linear processing rate functions

Nattaf, Margaux; Artigues, Christian; López, Pierre

doi:10.1007/s10601-017-9271-4

Cited by 8 publications

(2 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is easy to extend our framework to processes having flexible durations; see(Nattaf, Artigues, and Lopez 2017) for richer models.The Thirty-Second AAAI Conference on Artificial Intelligence …”

mentioning

confidence: 99%

Load Scheduling of Simple Temporal Networks Under Dynamic Resource Pricing

Kumar

Wang

Kumar

et al. 2018

AAAI

View full text Add to dashboard Cite

We study load scheduling of simple temporal networks (STNs) under dynamic pricing of resources. We are given a set of processes and a set of simple temporal constraints between their execution times, i.e., an STN. Each process uses a certain amount of resource for execution. The unit price of the resource is a function of time, f(t). The goal is to find a schedule of a given STN that trades off makespan minimization against cost minimization within a user-specified suboptimality bound. We provide a polynomial-time algorithm for solving the load scheduling problem when f(t) is piecewise constant. This has important applications in many real-world domains including the smart home and smart grid domains. We then study the dependency of the unit price of the resource on time as well as the total demand at that time. This leads to a further characterization of tractable, NP-hard, and conjectured tractable cases.

show abstract

mentioning

confidence: 99%

Load Scheduling of Simple Temporal Networks Under Dynamic Resource Pricing

Kumar

Wang

Kumar

et al. 2018

AAAI

View full text Add to dashboard Cite

show abstract

“…Complementarity of the algorithms is assessed via their integration in a hybrid branch-and-bound and computational experiments on a set of randomly generated instances. This abstract refers to the full paper [2].…”

mentioning

confidence: 99%

Integration of AI and OR Techniques in Constraint Programming

Salvagnin¹,

Lombardi²

2017

Lecture Notes in Computer Science

View full text Add to dashboard Cite

material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, express or implied, with respect to the material contained herein or for any errors or omissions that may have been made. The publisher remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

show abstract