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

References

  1. [1] Baker, K.R. Introduction to Sequencing and Scheduling. Wiley, New York, 1974.
    Search in Google Scholar
  2. [2] Baker, K.R., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G. Preemptive scheduling of a single machine to minimize maximum cost subject to release dates and precedence constraints. Operations Research, 26: 111-120 (1983).10.1287/opre.31.2.381
    Search in Google Scholar
  3. [3] Brucker, P. Scheduling Algorithms (third edition). Springer, Berlin, 2001.10.1007/978-3-662-04550-3
    Search in Google Scholar
  4. [4] Blazewicz, J., Dror, M. Mathematical programming formulations for machine scheduling: A survey. European journal of Operational Research, 51: 283-300 (1991).10.1016/0377-2217(91)90304-E
    Search in Google Scholar
  5. [5] Du, J., Leung, J.Y.T. Minimizing mean ow time with release time and deadline constraints. Journal of Algorithms, 14: 45-68 (1993).10.1006/jagm.1993.1003
    Search in Google Scholar
  6. [6] Du, J., Leung, J.Y.T., Young, G.H. Minimizing mean ow time with release time constraints. Theoretical Computer Science, 75: 347-355 (1990).10.1016/0304-3975(90)90100-V
    Search in Google Scholar
  7. [7] Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G. Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5: 287-326 (1979).10.1016/S0167-5060(08)70356-X
    Search in Google Scholar
  8. [8] Horn, W.A. Some simple scheduling algorithms. Naval Research Logistics Quar- terly, 21: 177-18 (1974).10.1002/nav.3800210113
    Search in Google Scholar
  9. [9] Smith, W.E. Various optimizers for single-stage production. Naval Research Lo- gistics Quarterly, 3: 59-66 (1956).10.1002/nav.3800030106
    Search in Google Scholar
  10. [10] Sourd, F. Preemptive scheduling with two minimax criteria. Annals of Operations Research, 107: 303-319 (2001).10.1023/A:1014971620268
    Search in Google Scholar
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