Minimizing mean tardiness subject to unspecified minimum number tardy for a single machine

European Journal of Operational Research

Volumn 89, Issue 1, 1996, Pages 100-107

  Ben Daya, M ^a   Duffuaa, S O ^a   Raouf, A ^a  

^a KING FAHD UNIVERSITY OF PETROLEUM AND MINERALS   (Saudi Arabia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; JOB ANALYSIS; OPTIMIZATION; PROBLEM SOLVING; PRODUCTION CONTROL; SCHEDULING;

BRANCH AND BOUND SCHEME; MEAN TARDINESS; MINIMUM TARDY; SINGLE MACHINE SCHEDULING;

OPERATIONS RESEARCH;

EID: 0042629658     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(94)00241-X     Document Type: Article

References (14)

1. K.R. Baker Z. Su Sequencing with due dates and early start times to minimize maximum tardiness Naval Research Logistics Quarterly 25 1974 171 176
2. K.R. Baker, Introduction to Sequencing and Scheduling 1974 Wiley New York
3. S.O. Duffuaa A. Raouf M. Ben-Daya Onemachine scheduling to minimize mean tardiness with minimum number tardy 1993 Systems Engineering Dept., King Fahd University of Petroleum and Minerals Dhahran 31261, Saudi Arabia,
4. R.N. Burns Scheduling to minimize the weighted sum of completion time with secondary criteria Naval Research Logistics Quarterly 23 1976 125 130
5. P. Dileepan T. Sen Bicriterion static scheduling research for a single machine Omeg 16 1988 53 59
6. J. Du J.Y.T. Leung Minimizing total tardiness on one machine is NP-hard Mathematics of Operations Research 15 1990 483 495
7. H. Emmons One machine sequencing to minimize mean flow time with minimum tardy Naval Research Logistics Quarterly 22 1975 858 892
8. S. French Sequencing and Scheduling 1982 Ellis Horwood Chichester
9. S.K. Gupta J. Kyparisis Single machine scheduling research Omega 15 1995 207 227
10. J. Kyparisis C. Douligeris Single machine scheduling to minimize total flow time with minimum number tardy Journal of the Operational Research Society 44/8 1982 835 838
11. J.M. Moore An n job, one machine sequencing algorithm for minimizing the number of late jobs Management Science 15 1968 102 109
12. J.G. Shanthinkumar The use of decomposition approaches in a single machine scheduling problem Journal of the Operations Research Society of Japan 25 1982 29 37
13. J.G. Shanthikumar Scheduling n jobs on one machine to minimize the maximum tardiness with minimum tardy Computers and Operations Research 10/3 1983 255 266
14. J. Shwimer On the n-job, one-machine, sequence independent scheduling problem with tardiness penalties. A branch and bound solution Management Science 18/6 1972