Single facility scheduling with dual criteria: minimizing maximum tardiness subject to minimum number of tardy jobs

References

• BELLMAN , R. , ESOGBUE , A. O. , and NABESHIMA , I. , 1982 , Mathematical Aspects of Scheduling and Applications , ( Pergamon Press, New York ).
   Google Scholar
• BAKER , K. R. , 1974 , Introduction to Sequencing and Scheduling ( John Wiley, New York ).
   Google Scholar
• COFFMAN , E. G. (ed.), 1975 , Computers and Job-shop Scheduling ( John Wiley, New York ).
   Google Scholar
• CONWAY , R. W. , MAxWELL , W. L. , and MILLER , L.W. , 1967 , Theory of Scheduling , ( Addison-Wesley, Reading , MA ).
   Google Scholar
• DILEEPAN , P. , and SEN , T. , 1988 , Bicriterion static scheduling research for a single machine. OMEGA , 16 , 53 – 59 .
   Web of Science ®Google Scholar
• FRENCH , S. , 1982 , Sequencing and Scheduling , ( Halsted Press, New York ).
   Google Scholar
• FRY , T. D. , ARMSTRONG , R. D. , and LEWIS , H. , 1989 , A framework for single machine multiple objective sequencing research. OMEGA , 17 , 595 – 607 .
   Web of Science ®Google Scholar
• GAREY , M. R. , and JOHNSON , D. S. , 1979 , Computers and Intractability: A Guide to the Theory of NP Completmess , ( W. H. Freeman, San Francisco , CA ).
   Google Scholar
• GUPTA , J. N. D. , 1987 , An efficient solution procedure for the single facility scheduling problem with dual criteria. In Proceedings of the Twenty Third Annual Meeting of the Southeastem Chapter oft he Institute of Management Sciences , Myrtle Beach , SC , USA , pp. 186 – 188 .
   Google Scholar
• GUPTA , S. K. , and KYPARISS , J. , 1987 , Single machine scheduling research. OMEGA , 15 , 207 – 227 .
   Web of Science ®Google Scholar
• HOOGEVEEN , H. , 1992 , Single-machine bicritaia scheduling , PhD dissertation, Center for Mathematics and Computer Sciences, Amsterdam , The Netherlands.
   Google Scholar
• JACKSON , J. R. , 1955 , Scheduling a production line to minimize maximum tardiness. , Management Science Research Report, University of California at Los Angeles, California , January 1955 .
   Google Scholar
• LAWLER , E. L. , LENSTRA , J. K. , RINNOOY KAN , A. H. G. , and SHMOYS , D. B. , 1993 , Sequencing and scheduling: algorithms and complexity. In S. C. Graves , A. H. G. Rinnooy Kan and P. H. Zipkin (eds) Handbooks in Operations Research and Management Science , Vol. 4 ( Elsevier Science Publishers, B. V., Amsterdam ) pp. 445 – 552 .
   Google Scholar
• LEE , C.–Y. , and VAIRAKTARAKIS , G. L. , 1993 , Complexity ofsingle machine hierarchical scheduling: a survey. In P. M. Paradalos (ed.) Complexity in Numerical Optimization , ( World Scientific Publishing, River Edge , NJ ), pp. 269 – 297 .
   Google Scholar
• MELNYK , S. A. , VICKERY , S. K. , and CARTER , R. L. , 1986 , Scheduling, sequencing, and dispatching: alternate perspectives. Production and Inventory Management , 27 ( 2 ), 58 – 68 .
   Google Scholar
• MOORE , J. M. , 1968 , An njob, one-machine sequencing algorithm for minimizing the number of late jobs. Management Science , 15 , 102 – 109 .
   Web of Science ®Google Scholar
• SHANTHIKUMAR , J. G. , 1983 , Scheduling njobs on one machine to minimize tbe maximum tardiness with minimum number of jobs tardy. Computers and Operations Research , 10 , 255 – 267 .
   Web of Science ®Google Scholar
• VAIRAKTARAKIS , G. L. , and LEE , C.–Y. , 1992 , The single machine problem to minimize total tardiness subject to minimum number of tardy jobs. Research Report No. 92-4, Department of Industrial and Systems Engineering , University of F1orida, Gainesville , FL .
   Google Scholar