Algorithms for multiprocessor scheduling with machine release times

References

• Graham , R.L. ( 1969 ) Bounds on multiprocessing timing anomalies . SIAM Journal of Applied Mathematics , 17 , 263 – 269 .
   Web of Science ®Google Scholar
• Coffman Jr , E.G. , Garey , M.R. and Johnson , D.S. ( 1978 ) An application of bin-packing to multiprocessor scheduling . SIAM Journal of Computing , 7 , 1 – 17 .
   Web of Science ®Google Scholar
• Friesen , D.K. ( 1984 ) Tighter bounds for the muitifit processor scheduling algorithm . SIAM Journal of Computing , 13 , 35 – 59 .
   Web of Science ®Google Scholar
• Yue , M. ( 1990 ) On the exact upper bound for the MULTIFIT processor scheduling algorithm , in Operations Research in China , Yue, M. (ed.) , Vol. 24 of Annals of Operations Research , Baltzer , Basel , Switzerland , pp. 233 – 259 .
   Google Scholar
• Hochbaum , D S. and Shmoys , D. ( 1987 ) Using dual approximation algorithms for scheduling problems theoretical and practical results . Journal of the Association of Computing Machinery , 34 , 144 – 162 .
   Web of Science ®Google Scholar
• Friesen , D.K. and Deuermayer , B.L. ( 1981 ) Analysis of greedy solution for a replacement part sequencing problem . Mathematics of Operations Research , 6 , 74 – 87 .
   Web of Science ®Google Scholar
• Deuermayer , B.L. , Friesen , D.K. and Langston , M.A. ( 1982 ) Scheduling to maximize the minimum processor finish time in a multiprocessor system . SIAM Journal of Algebraic and Discrete Methods , 3 , 190 – 196 .
   Google Scholar
• Csirik , J. , Kellerer , H. and Woeginger , G. ( 1992 ) The exact LPT-bound for maximizing the minimum completion time . Operations Research Letters , 11 , 281 – 287 .
   Web of Science ®Google Scholar
• Stecke , K.E. , Sun , R. (eds) ( 1985 ) Flexible Manufacturing Systems Operations Research Models and Applications, Vol. 3 of Annals of Operations Research , Baltzer , Basel , Switzerland .
   Google Scholar
• Schmidt , G. ( 1984 ) Sheduling on semi-identical processors . Zeitschift für Operations Research , 28 , 153 – 162 .
   Google Scholar
• Lee , C.Y. ( 1991 ) Parallel machines sheduling with nonsimultaneous machine available time . Discrete Applied Mathematics , 30 , 53 – 61 .
   Web of Science ®Google Scholar
• Kellerer , H. , Kotov , V. , Rendl , F. and Woeginger , G. ( 1998 ) The stock size problem . Operations Research 46 ( suppl. ) 1 – 13 .
   Web of Science ®Google Scholar
• Graham , R.L. ( 1966 ) Bounds for certain multiprocessing anomalies . Bell System Technical Journal , 45 , 1563 – 1581 .
   Google Scholar