Scheduling jobs to improve weighted on-time performance of a single machine

Journal of Manufacturing Systems

Volumn 22, Issue 2, 2003, Pages 148-156

  Phojanamongkolkij, Nipa ^a   Grabenstetter, Douglas ^a   Ghrayeb, Omar ^a  

^a NORTHERN ILLINOIS UNIVERSITY   (United States)

Author keywords

Heuristics; On Time Delivery; Single Machine Scheduling; Weighted Number of Tardy Jobs

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; DECISION MAKING; HEURISTIC METHODS; INDUSTRIAL ENGINEERING; JOB ANALYSIS; POLYNOMIALS; PRESSES (MACHINE TOOLS); REAL TIME SYSTEMS; SCHEDULING;

HEURISTICS; ON-TIME DELIVERY (OTD); SINGLE-MACHINE SCHEDULING; WEIGHTED NUMBER OF TARDY JOBS;

MACHINING;

EID: 3042546367     PISSN: 02786125     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0278-6125(03)90012-4     Document Type: Article

References (20)

1. Chen, D.; Tang, G.; and Li, S. (1997). "Single-machine scheduling with common due date assignment in a group technology environment." Mathematical Computer Modeling (v25, n3), pp81-90.
2. Emmons, H. (1969). "One machine sequencing to certain functions of job tardiness." Operations Research (v17), pp701-715.
3. Emmons, H. (1975). "One machine sequencing to minimize mean flowtime with minimum number tardy." Naval Research Quarterly (v22), pp858-892.
4. Gens, G.V. and Levner, E.V. (1981). "Fast approximation algorithms for job sequencing with deadlines." Discrete Applied Mathematics (v3), pp313-318.
5. Gupta, S.K. and Kyparisis, J. (1987). "Single-machine scheduling research." OMEGA Int'l Journal of Mgmt. Science (v15, n3), pp207-227.
6. Hodgson, T.J. (1977). "A note on single-machine sequencing with random processing times." Mgmt. Science (v23, n10), pp1144-1146.
7. Ibarra, O. and Kim, C. (1978). "Approximation algorithms for certain scheduling problems." Mathematics of Operations Research (v3, n3), pp197-204.
8. Kyparisis, J. and Douligeris, C. (1993). "Single-machine scheduling and selection to minimize total flowtime with minimum number tardy." Journal of the Operational Research Society (v44), pp835-838.
9. Lawler, E.L. (1976). "Sequencing to minimize the weighted number of tardy jobs." Univ. of California at Berkeley, Computer Sciences Div. (v10, n5), pp28-33.
10. Lawler, E.L. and Moore, J.M. (1969). "A functional equation and its application to resource allocation and sequencing problems. Mgmt. Science (v16, n1), pp77-84.
11. Lin, B.M.T. and Cheng, T.C.E. (1999). "Minimizing the weighted number of tardy jobs and maximum tardiness in a relocation problem with due date constraints." European Journal of Operational Research (v116), pp183-193.
12. Maxwell, W.L. (1970). "On sequencing n jobs on one machine to minimize the number of late jobs." Mgmt. Science (v16, n5), pp295-297.
13. Moore, J.M. (1968). "An n job, one machine sequencing algorithm for minimizing the number of late jobs," Mgmt. Science (v15, n1), pp102-109.
14. Pinedo, M. (1995). Scheduling theory, algorithms, and systems. Englewood Cliffs, NJ: Prentice Hall.
15. Potts, C.N. and Van Wassenhove, L.N. (1988). "Algorithms for scheduling a single-machine to minimize the weighted number of late jobs." Mgmt. Science (v34, n7), pp843-858.
16. Rote, G. and Woeginger, G.J. (1998). "Minimizing the number of tardy jobs on a single-machine with batch set up times." Acta Cybernetica (v13), pp423-429.
17. Sahni, S. (1976). "Algorithms for scheduling independent tasks." Journal of the Association for Computing Machinery (v23, n1), pp116-127.
18. Smith, W.E. (1956). "Various optimizers for single stage production." Naval Research Logistics Quarterly (v3, n1), pp59-66.
19. Srinivasan, V. (1971). "A hybrid algorithm for the one machine sequencing problem to minimize total tardiness." Naval Research Logistics Quarterly (v18), pp317-327.
20. Villarreal, F.J. and Bulfin, R.L. (1983). "Scheduling a single-machine to minimize the weighted number of tardy jobs." IIE Trans. (v15, n7), pp337-343.