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

[1] Baker, K.R. Introduction to Sequencing and Scheduling. Wiley, New York, 1974.Search in Google Scholar

[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.381Search in Google Scholar

[3] Brucker, P. Scheduling Algorithms (third edition). Springer, Berlin, 2001.10.1007/978-3-662-04550-3Search in Google Scholar

[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-ESearch in Google Scholar

[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.1003Search in Google Scholar

[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-VSearch in Google Scholar

[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-XSearch in Google Scholar

[8] Horn, W.A. Some simple scheduling algorithms. Naval Research Logistics Quar- terly, 21: 177-18 (1974).10.1002/nav.3800210113Search in Google Scholar

[9] Smith, W.E. Various optimizers for single-stage production. Naval Research Lo- gistics Quarterly, 3: 59-66 (1956).10.1002/nav.3800030106Search in Google Scholar

[10] Sourd, F. Preemptive scheduling with two minimax criteria. Annals of Operations Research, 107: 303-319 (2001).10.1023/A:1014971620268Search in Google Scholar