An Improved LLF Scheduling for Reducing Maximum Heap Memory Consumption by Considering Laxity Time.
Yuki MachigashiraAkio NakataPublished in: TASE (2018)
Keyphrases
- scheduling algorithm
- data structure
- scheduling problem
- round robin
- flexible manufacturing systems
- resource constraints
- neural network
- learning algorithm
- real time database systems
- resource allocation
- suffix tree
- significantly reduced
- computational grids
- data sets
- maximum number
- times faster
- objective function
- case study
- website
- artificial intelligence