Scheduling single-machine problems for on-time delivery

Computers and Industrial Engineering

Volumn 39, Issue 3-4, 2001, Pages 371-392

  Yoo, W S ^a   Martin Vega, L A ^b  

^a GANNON UNIVERSITY   (United States)

^b Lehigh University   (United States)

Author keywords

Due date; Heuristics; Number of early tardy jobs; Number of tardy jobs; Scheduling

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; OUTSOURCING; PROBLEM SOLVING; PROCESS ENGINEERING; RESOURCE ALLOCATION; SCHEDULING; STRATEGIC PLANNING;

MOORE-HODGSON ALGORITHMS; ON-TIME DELIVERY;

JUST IN TIME PRODUCTION;

EID: 0035309617     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0360-8352(01)00012-2     Document Type: Article

References (41)

1. Anger, F. D., Lee, C. -Y., & Martin-Vega, L. A. (1986). Single machine scheduling with tight windows, Research Report 86-16, Department of Industrial and Systems Engineering, University of Florida.
2. Baker, K. R., & Scudder, G. D. (1990). Sequencing with earliness and tardiness penalties: a review. Operations Research, 38.
3. Cheng, T. C. E. (1988). Optimal common due-date with limited completion times deviation. Computers and Operations Research, 15, 91-96.
4. Garey, M. R., & Johnson, D. S. (1979). Computers and intractability, San Francisco: Freeman.
5. Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling. Annals of Discrete Mathematics, 5, 287-326.
6. Hoogeveen, J. A., & Van De Velde, S. L. (1991). Scheduling around a small common due-date. European Journal of Operational Research, 55.
7. Kanet, J. J., & Christy, D. P. (1989). Manufacturing systems with forbidden early shipment: implications for setting manufacturing lead times. International Journal of Production Research, 27.
8. Kise, H., Ibaraki, T., & Mine, H. (1978). A solvable case of the one-machine scheduling problem with ready and due times. Operations Research, 26, 121-126.
9. Kramer, F. -J., & Lee, C. -Y. (1993). Common due-window scheduling. Production and Operations Management, 2.
10. Kramer, F. -J., & Lee, C. -Y. (1994). Due window scheduling for parallel machines. Mathematical Computer Modelling, 20.
11. Lageweg, B. J., Lawler, J. K., Lenstra, J. K., & Rinnooy, K. (1981). Computer-aided complexity classification of deterministic scheduling problems, Report BW 138, Mathematisch Centrum, Amsterdam.
12. Lakshminarayan, S., Lakshmanan, R., Papineau, R. L., & Rochette, R. (1978). Optimal single-machine scheduling with earliness and tardiness penalties. Operations Research, 26.
13. Lawler, E. L. (1976). Sequencing to minimize the weighted number of tardy jobs. Revue Francaise Automatique, Informatique et Recherche Operationelle, 10, 27-33.
14. Lawler, E. L., & Martel, C. U. (1989). Preemptive scheduling of two uniform machines to minimize the number of late jobs. Operations Research, 37 (2).
15. Lawler, E. L., & Moore, J. M. (1969). A functional equation and its application to resource allocation and sequencing problems. Management Science, 16, 77-84.
16. Lee, C. -Y. (1991). Earliness-tardiness scheduling problems with constant size of due-date window. Research Report 91-17, Department of Industrial and Systems Engineering, University of Florida.
17. Lee, C. -Y., Danusaputro, S. L., & Lin, C. -S. (1991). Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due-date. Computers and Operations Research, 18.
18. Li, C. -L. (1995). A heuristic for parallel machine scheduling with agreeable due-dates to minimize the number of late jobs. Computers and Operations Research, 22 (3).
19. Li, C. -L. (1995). A heuristic for parallel machine scheduling with agreeable due-dates to minimize the number of late jobs. Computers and Operations Research, 22.
20. Liman, S. D., & Lamaswamy, S. (1994). Earliness-tardiness scheduling problems with a common delivery window. Operations Research Letters, 15, 195-203.
21. Liman, S. D., & Lee, C. -Y. (1992). Error bound for a heuristic on the common due-date scheduling problem, ORSA Journal of Computing
22. Maxwell, W. K. (1970). On sequencing n jobs on one machine to minimize the number of late jobs. Management Science, 16.
23. Monma, C., & Potts, C. N. (1989). On the complexity of scheduling with batch setup times. Operations Research, 37, 798-804.
24. Moore, J. M. (1968). An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science, 15 (1) (September).
25. Morton, T. E., & Pentico, D. W. (1993). Heuristic scheduling system, New York: Wiley.
26. Morton, T. E., Rachamadugu, R. M., & Vepsalainen, A. (1984). Accurate myopic heuristics for tardiness scheduling. Working Paper #36-83-84, Graduate School of Business Administration, Carnegie Mellon University, Pittsburgh, PA.
27. Ovacik, I. M., & Uzsoy, R. (1994). Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times. Research Memorandum No. 94-23, School of Industrial Engineering, Purdue University.
28. Potts, C. N., & Van Wassenhove, L. N. (1988). Algorithms for scheduling a single machine to minimize the weighted number of late jobs. Management Science, 34, 843-858.
29. Rohleder, T. R., & Scudder, G. D. (1992). Scheduling with forbidden early shipment environment: a comparison of economic objectives. International Journal of Production Research, 30.
30. Sahni, S. (1976). Algorithms for scheduling independent tasks. Journal of the ACM, 23, 116-127.
31. Scudder, G. D., & Hoffmann, T. R. (1989). The use of cost-based priorities when early shipments are forbidden. International Journal of Production Research, 27, 1989.
32. Scudder, G. D., & Rohleder, T. R. (1993). Scheduling rule selection for the forbidden early shipment environment: alternative performance criteria and conditions. International Journal of Production Research, 31.
33. Sidney, J. (1973). An extension of Moore's due-date algorithm. In S. E. (Ed.), Symposium on the Theory of Scheduling and its Application. New York: Springer.
34. Sidney, J. B. (1977). Optimal single-machine scheduling with earliness and tardiness penalties. Operations Research, 25.
35. Sturm, L. B. J. M. (1970). A simple optimality proof of Moore's sequencing algorithm. Management Science, 17 (1) (September).
36. Sun, D., & Lin, L. (1994). A dynamic job shop scheduling framework: a backward approach. International Journal of Production Research, 32.
37. Usn, L. (1973). Scheduling to minimize the number of late jobs when set-up and processing times are uncertain. Management Science, 19 (July).
38. Uzsoy, R., Church, L. K., Ovacik, I. M., & Hinchman, J. (1993). Performance evaluation of dispatching rules for semiconductor testing operations. Journal of Electronics Manufacturing, 3, 95-105.
39. Uzsoy, R., Lee, C. Y., & Martin-Vega, L. A. (1992). Scheduling semiconductor test operations: minimizing maximum lateness and number of tardy jobs on a single machine. Naval Research Logistics, 39, 369-388.
40. Uzsoy, R., Martin-Vega, L. A., Lee, C. -Y., & Leonard, P. A. (1991). Production scheduling algorithms for a semiconductor test facility. IEEE Transactions on Semiconductor Manufacturing, 4 (4).
41. Villarreal, F. J., & Bulfin, R. L. (1991). Scheduling semiconductor testing operations: optimization and approximation. Proceedings of the Joint US-German Conference on New Directions for Operations Research in Manufacturing, Gaithersburg, MD, July (pp. 30-31).