Login
Register
Reset Password
Publish & Distribute
Publishing Solutions
Distribution Solutions
Subjects
Architecture and Design
Arts
Business and Economics
Chemistry
Classical and Ancient Near Eastern Studies
Computer Sciences
Cultural Studies
Engineering
General Interest
Geosciences
History
Industrial Chemistry
Jewish Studies
Law
Library and Information Science, Book Studies
Life Sciences
Linguistics and Semiotics
Literary Studies
Materials Sciences
Mathematics
Medicine
Music
Pharmacy
Philosophy
Physics
Social Sciences
Sports and Recreation
Theology and Religion
Publications
Journals
Books
Proceedings
Publishers
Blog
Contact
Search
EUR
USD
GBP
English
English
Deutsch
Polski
Español
Français
Italiano
Cart
Home
Journals
Foundations of Computing and Decision Sciences
Volume 39 (2014): Issue 1 (February 2014)
Open Access
Minimizing Total Completion Time For Preemptive Scheduling With Release Dates And Deadline Constraints
Cheng He
Cheng He
,
Hao Lin
Hao Lin
,
Yixun Lin
Yixun Lin
and
Junmei Dou
Junmei Dou
| Mar 11, 2014
Foundations of Computing and Decision Sciences
Volume 39 (2014): Issue 1 (February 2014)
About this article
Previous Article
Next Article
Abstract
References
Authors
Articles in this Issue
Preview
PDF
Cite
Share
Published Online:
Mar 11, 2014
Page range:
17 - 26
DOI:
https://doi.org/10.2478/fcds-2014-0002
Keywords
Preemptive Scheduling
,
Release date
,
Deadline
,
Total completion time
This content is open access.
Cheng He
School of Science, Henan University of Technology, Zhengzhou, Henan 450052, China.
Hao Lin
School of Science, Henan University of Technology, Zhengzhou, Henan 450052, China.
Yixun Lin
Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450052, China
Junmei Dou
School of Science, Henan University of Technology, Zhengzhou, Henan 450052, China.