MAKESPAN MINIMIZATION ON IDENTICAL PARALLEL MACHINES SUBJECT TO MINIMUM TOTAL FLOW-TIME

REFERENCES

• Bruno , J. L. , Coffman , E. G. and Sethi , R. 1974 . Algorithms for minimizing mean flow time . IFIPS Congress , 74 : 504 – 510 .
   Google Scholar
• Coffman , E. G. and Sethi , R. 1976 . Algorithms minimizing mean flow time: schedule length properties . Acta Informatica , 6 : 1 – 14 .
   Google Scholar
• Coffman , E. G. , Garey , M. R. and Johnson , D. S. 1978 . An application of bib-packing to multi-processor scheduling . SIAM Journal on Computing , 7 : 1 – 17 .
   Web of Science ®Google Scholar
• Conway , R. W. , Maxwell , W. L. and Miller , L. W. 1976 . Theory of scheduling MA : Addison Wesley .
   Google Scholar
• Eck , B. T. and Pinedo , M. 1993 . On the minimization of the makespan subject to flowtime optimality . Operations Research , 41 : 797 – 801 .
   Google Scholar
• Gupta , J. N. D. and Ho , J. C. 2001 . Two machines hierarchical scheduling with makespan and flowtime criteria . Computers and Operations Research , 28 : 705 – 717 .
   Web of Science ®Google Scholar
• Gupta , J. N. D. and Ruiz-Torres , A. J. 2000 . Minimizing makespan subject to minimum total flow-time on identical parallel machines . European Journal of Operational Research , 125 : 370 – 380 .
   Google Scholar
• Leung , J. Y-T. and Young , G. H. 1989 . Minimizing schedule length subject to minimum flow time . SIAM Journal on Computing , 18 : 314 – 326 .
   Google Scholar