z-logo
open-access-imgOpen Access
A polynomial satisfiability test using energetic reasoning for energy-constraint scheduling
Author(s) -
Margaux Nattaf,
Christian Artigues,
Pierre López
Publication year - 2014
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - computer science , satisfiability , mathematical optimization , scheduling (production processes) , schedule , piecewise linear function , time complexity , job shop scheduling , linear programming , algorithm , mathematics , geometry , operating system

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here