Have a personal or library account? Click to login
Minimizing Total Completion Time For Preemptive Scheduling With Release Dates And Deadline Constraints Cover

Minimizing Total Completion Time For Preemptive Scheduling With Release Dates And Deadline Constraints

Foundations of Computing and Decision Sciences
Volume 39 (2014): Issue 1 (February 2014)
By: Cheng He,  Hao Lin,  Yixun Lin and  Junmei Dou  
Open Access
|Mar 2014

Download Article

Download the full article as a PDF file.

DOI: https://doi.org/10.2478/fcds-2014-0002 | Journal eISSN: 2300-3405 | Journal ISSN: 0867-6356
Journal RSS Feed
Language: English
Page range: 17 - 26
Published on: Mar 11, 2014
Published by: Poznan University of Technology
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year
Keywords:
Preemptive Scheduling,
Release date,
Deadline,
Total completion time
Related subjects:
Computer sciences,
Artificial intelligence,
Software development

© 2014 Cheng He, Hao Lin, Yixun Lin, Junmei Dou, published by Poznan University of Technology
This work is licensed under the Creative Commons License.

Previous articleVolume 39 (2014): Issue 1 (February 2014)Next article