JOB ASSIGNMENT ALGORITHMS ON UNIFORM PARALLEL MACHINES

References

• Brah , S. A. ( 1996 ). A comparative analysis of due date based job sequencing rules in a flow shop with multiple processors . Production Planning and Control , 7 ( 4 ), 362 – 373 .
   Web of Science ®Google Scholar
• Cheng , T. C. E. and Sin , C. C. S. ( 1990 ). A state-of-the-art review of parallel-machine scheduling research . Eur. J. Opnl. Res. , 47 , 271 – 292 .
   Web of Science ®Google Scholar
• Dobson , G. ( 1984 ). Scheduling independent tasks on uniform processors . SIAM J. Comput. , 13 ( 4 ), 705 – 716 .
   Web of Science ®Google Scholar
• Drozdowski , M. ( 1996 ). Scheduling multiprocessor tasks - An overview . Eur. J. Opnl. Res. , 94 , 215 – 230 .
   Web of Science ®Google Scholar
• Franca , P. M. , Gendreau , M. , Laporte , G. and Muller , F. M. ( 1994 ). A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective . Computers and O.R. , 21 ( 2 ), 205 – 210 .
   Web of Science ®Google Scholar
• Garey , M. R. and Johnson , D. S. ( 1979 ). Computers and Intractability A Guide to the Theory of NP-Completeness . W. H. Freeman , San Fransisco .
   Google Scholar
• Guinet , A. G. P. and Solomon , M. M. ( 1996 ). Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time . Int. J. Prod. Res. , 34 ( 6 ), 1643 – 1654 .
   Web of Science ®Google Scholar
• Hariri , A. M. A. and Potts , C. N. ( 1991 ). Heuristics for scheduling unrelated parallel machines . Computers and O.R. , 18 ( 3 ), 323 – 331 .
   Web of Science ®Google Scholar
• Horowitz , E. and Sahni , S. ( 1976 ). Exact and approximate algorithms for scheduling nonidentical processors . J. ACM , 23 ( 2 ), 317 – 327 .
   Web of Science ®Google Scholar
• Ibarra , O. H. and Kim , C. E. ( 1977 ). Heuristic algorithms for scheduling independent tasks on nonidentical processors . J. ACM , 24 ( 2 ), 280 – 289 .
   Web of Science ®Google Scholar
• Kobrinski , H. and Azuma , M. ( 1993 ). Distributed control algorithms for dynamic restoration in DCS mesh networks Performance evaluation . GLOBEC0M'93 , pp. 1584 – 1588 .
   Google Scholar
• Monma , C. L. and Potts , C. N. ( 1993 ). Analysis of heuristics for preemptive parallel machine scheduling with batch setup times . Opns. Res. , 41 ( 5 ), 981 – 993 .
   Web of Science ®Google Scholar
• Rinnooy Kan , A. H. G. ( 1976 ). Machine Scheduling Problems-. Classification, complexity and computations . Martinus Nijhoff , The Hague .
   Google Scholar
• Trietsch , D. and Baker , K. R. ( 1993 ). Basic techniques for lot stream . Opns. Res. , 14 ( 6 ), 1065 – 1076 .
   Google Scholar
• SR-NWT-002514 ( 1993 ). Digital Cross-Connect Systems in Transport Network Survivability , Issue 1 , Bellcore .
   Google Scholar
• Webster , S. T. ( 1996 ). A general lower bound for the makespan problem . Eur. J. Opnl.Res. , 89 , 516 – 524 .
   Google Scholar
• Wemmerlov , U. and Hyer , N. L. ( 1989 ). Cellular manufacturing in the U.S. industry A survey of users . Int. J. Prod. Res. , 27 ( 9 ), 1511 – 1530 .
   Web of Science ®Google Scholar
• Wu , T.-H. ( 1994 ). Passive protected self-healing mesh network architecture and application . IEEE/ACM Trans. Networking , 2 ( 1 ), 40 – 52 .
   Web of Science ®Google Scholar