An enhanced formulation and simple heuristic for scheduling jobs on unrelated parallel machines

References

• Eastman , W. L. , Even , S. and Isaacs , I. M. 1964 . Bounds for the optimal scheduling of n jobs on m processors . Management Science , 11 ( 2 ) : 268 – 279 .
   Web of Science ®Google Scholar
• Baker , K. R. and Merten , A. G. 1973 . Scheduling with parallel processors and linear delay costs . Naval Research logistics Quarterly , 20 ( 4 ) : 793 – 804 .
   Google Scholar
• Ho , J. C. and Chang , Y.-L. 1995 . Minimizing the number of tardy jobs for m parallel machines . European Journal of Operational Research , 84 : 343 – 355 .
   Web of Science ®Google Scholar
• Xing , W. and Zhang , J. 2000 . Parallel machine scheduling with splitting Jobs . Discrete Applied Mathematics , 103 : 259 – 269 .
   Web of Science ®Google Scholar
• Horn , W. A. 1973 . Minimizing average flow time with parallel machines . Operations Research , 21 : 846 – 847 .
   Web of Science ®Google Scholar
• Hariri , A. M.A and Potts , C. N. 1991 . Heuristics for scheduling unrelated parallel machines . Computers and Operations Research , 18 ( 3 ) : 323 – 331 .
   Web of Science ®Google Scholar
• Azizoglu , M. and Kirca , O. 1999 . Scheduling jobs on unrelated parallel machines to minimize regular total cost functions . IIE Transactions , 31 : 153 – 159 .
   Web of Science ®Google Scholar
• Chen , T. C. E. and Sin , C. C. S. 1990 . A state-of-the-art review of parallel-machine scheduling research . European Journal of Operational Research , 47 : 271 – 292 .
   Web of Science ®Google Scholar
• Bruno , J. , Coffman , E. G. and Sethi , R. 1974 . Scheduling independent tasks to reduce mean finishing time . Communications of the ACM , 17 ( 1 ) : 382 – 387 .
   Google Scholar
• Lawler , E. L. , Lenstra , J. K. , Rinnooy Kan , A. H. G. and Shmoys , D. B. 1993 . Sequencing and scheduling: algorithms and complexity , Amsterdam : North-Holland .
   Google Scholar
• Glover , F. and Woolsey , E. 1973 . Further reduction of zero-one polynomial programming problem to zero-one linear programming . Operations Research , 21 : 156 – 161 .
   Web of Science ®Google Scholar
• Glover , F. and Woolsey , E. 1974 . Converting the 0–1 polynomial programming problem to a 0–1 linear program . Operations Research , 22 ( 1 ) : 180 – 182 .
   Web of Science ®Google Scholar
• Watters , L. J. 1967 . Reduction of integer polynomial programming problems to zero-one linear programming problems . Operations Research , 15 : 1171 – 1174 .
   Web of Science ®Google Scholar