z-logo
open-access-imgOpen Access
Lower bounds for Scheduling Problems with production and consumption of resources
Author(s) -
Abderrahim Sahli,
Jacques Carlier,
Aziz Moukrim
Publication year - 2015
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - computer science , scheduling (production processes) , mathematical optimization , job shop scheduling , extension (predicate logic) , dynamic priority scheduling , upper and lower bounds , fair share scheduling , heuristic , resource constraints , genetic algorithm scheduling , rate monotonic scheduling , distributed computing , mathematics , schedule , artificial intelligence , mathematical analysis , programming language , 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
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom