Parallel machine scheduling about an unrestricted due date and additional resource constraints

References

• Baker , K.R. ( 1974 ) Inrroduction to Sequencing and Scheduling , Wiley , New York .
   Google Scholar
• Uzsoy , R. , Lee , C.Y. and Martin-Vega , L.A. ( 1992 ) A review of production planning and scheduling models in the semiconductor industry part I; system characteristics , performance evaluation and production planning . IIE Transactions on Scheduling and Logistics , 24 , 47 – 61 .
   Web of Science ®Google Scholar
• Chandru , V. , Lee , C.Y. and Uzsoy , R. ( 1993 ) Minimizing total completion time on batch processing machines . International Journal of Production Research , 31 , 2097 – 21 21.
   Web of Science ®Google Scholar
• Blazewicz , J. ( 1987 ) Selected topics in scheduling theory . Annals of Discrete Mathematics , 31 , 140 .
   Google Scholar
• Garey , M.R. and Johnson , D.S. ( 1975 ) Complexity results for multiprocessor scheduling under resource constraints . SIAM Journal on Computing , 4 , 397 – 411 .
   Google Scholar
• Blazewicz , J. , Barcelo , J. , Kubiak , W. and Rock , H. ( 1986 ) Scheduling tasks on two processors with deadlines and additional resources . European Journal ofOperational Research , 26 , 364 – 370 .
   Web of Science ®Google Scholar
• Blazewicz , J. , Kubiak , W. , Rock , H. and Szwarcfiter , J. ( 1987 ) Minimizing mean flow–time with parallel processors and resource constraints . Acta Informatica , 24 , 513 – 524 .
   Web of Science ®Google Scholar
• Baker , K.R. and Scudder , G.D. ( 1990 ) Sequencing with earliness and tardiness penalties a review . Operations Research , 38 , 22 – 36 .
   Web of Science ®Google Scholar
• Kanet , J.J. ( 1981 ) Minimizing the average deviation of job completion times about a common due date . Naval Research Logistics Quarterly , 28 , 643 – 651 .
   Google Scholar
• Blazewicz , J. , Cellary , W. , Slowinski , R. and Weglare , J. ( 1986 ) Scheduling under resource constraints – deterministic models , in Annals of Operations Research , Vol 7 , Hammer , P.L. ( ed. ), J.C. Baltzer AG , Basel , Switzerland .
   Google Scholar
• Bertsekas , D.P. ( 1991 ) Linear Network Optimization, Algorithm and Codes , MIT Press , Cambridge , MA .
   Google Scholar
• Kuhn , N.W. ( 1955 ) The Hungarian method for the assignment problem . Naval Research Logistics Quarterly , 2 , 83 – 97 .
   Google Scholar