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

Production Planning and Control

Volumn 7, Issue 2, 1996, Pages 190-196

  Gupta, Jatinder N D ^a   Ramnarayanan, Renu ^a  

^a State University   (United States)

Author keywords

Branch and bound; Computational results; Dual criteria; Heuristic algorithms; Single facility scheduling

Indexed keywords

ALGORITHMS; CALCULATIONS; HEURISTIC METHODS; MANUFACTURE; OPTIMIZATION;

DUAL CRITERIA; SINGLE FACILITY SCHEDULING;

SCHEDULING;

EID: 0030109030     PISSN: 09537287     EISSN: 13665871     Source Type: Journal    
DOI: 10.1080/09537289608930341     Document Type: Article

References (18)

1. Bellman, R., Esogbue, A. O., and Nabeshima, I., 1982, Mathematical Aspects of Scheduling and Applications (Pergamon Press, New York)
2. Baker, K. R., 1974, Introduction to Sequencing and Scheduling (John Wiley, New York)
3. Coffman, E. G., (ed.), 1975, Computers and Job-shop Scheduling (John Wiley, New York)
4. Conway, R. W., Maxwell, W. L., and Miller, L. W., 1967, Theory of Scheduling (Addison-Wcsley, Reading, MA)
5. Dileepan, P., and Sen, T., 1988, Bicriterion static scheduling research for a single machine. OMEGA, 16, 53-59
6. French, S., 1982, Sequencing and Scheduling (Halsted Press, New York)
7. Fry, T. D., Armstrong, R. D., and Lewis, H., 1989, A framework for single machine multiple objective sequencing research. OMEGA, 17, 595-607
8. Garey, M. R., and Johnson, D. S., 1979, Computers and Intractability: A Guide to the Theory of NP Completeness (W. H. Freeman, San Francisco, CA)
9. 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 Southeastern Chapter of the Institute of Management Sciences, Myrtle Beach, SC, USA, pp. 186-188
10. Gupta, S. K., and Kypariss, J., 1987, Single machine scheduling research. OMEGA, 15, 207-227
11. Hoogeveen, H., 1992, Single-machine bicriteria scheduling, PhD dissertation, Center for Mathematics and Computer Sciences, Amsterdam, The Netherlands
12. Jackson, J. R., 1955, Scheduling a production line to minimize maximum tardiness. Management Science Research Report, University ofCalifornia at Los Angeles, California, January 1955
13. 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
14. Lee, C-Y., and Vairaktarakis, G. L., 1993, Complexity of single machine hierarchical scheduling: a survey. In P. M. Paradalos (ed.) Complexity in Numerical Optimization (World Scientific Publishing, River Edge, NJ), pp. 269-297
15. 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
16. Moore, J. M., 1968, An n job, one-machine sequencing algorithm for minimizing the number of late jobs. RIanagement Science, 15, 102-109
17. Shanthikumarj, 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
18. 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 Florida, Gainesville, FL