Minimizing Total Completion Time For Preemptive Scheduling With Release Dates And Deadline Constraints
By: Cheng He, Hao Lin, Yixun Lin and Junmei Dou
Open Access
|Mar 2014References
- [1] Baker, K.R. Introduction to Sequencing and Scheduling. Wiley, New York, 1974.
- [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).
- [3] Brucker, P. Scheduling Algorithms (third edition). Springer, Berlin, 2001.
- [4] Blazewicz, J., Dror, M. Mathematical programming formulations for machine scheduling: A survey. European journal of Operational Research, 51: 283-300 (1991).
- [5] Du, J., Leung, J.Y.T. Minimizing mean ow time with release time and deadline constraints. Journal of Algorithms, 14: 45-68 (1993).
- [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).
- [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).
- [8] Horn, W.A. Some simple scheduling algorithms. Naval Research Logistics Quar- terly, 21: 177-18 (1974).
- [9] Smith, W.E. Various optimizers for single-stage production. Naval Research Lo- gistics Quarterly, 3: 59-66 (1956).
- [10] Sourd, F. Preemptive scheduling with two minimax criteria. Annals of Operations Research, 107: 303-319 (2001).
DOI: https://doi.org/10.2478/fcds-2014-0002 | Journal eISSN: 2300-3405 (formerly 0867-6356) | Journal ISSN: 0867-6356
Language: English
Page range: 17 - 26
Published on: Mar 11, 2014
Published by: Poznan University of Technology
In partnership with: Paradigm Publishing Services
Related subjects:
© 2014 Cheng He, Hao Lin, Yixun Lin, Junmei Dou, published by Poznan University of Technology
This work is licensed under the Creative Commons License.