Due-date determination with resequencing

IIE Transactions (Institute of Industrial Engineers)

Volumn 31, Issue 2, 1999, Pages 183-188

  Chung Lun, L I ^a,b  

^a WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; JOB ANALYSIS; MATHEMATICAL MODELS; PRODUCTION CONTROL; SCHEDULING;

DUE-DATE DETERMINATION; RESEQUENCING;

OPERATIONS RESEARCH;

EID: 0032668257     PISSN: 0740817X     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1007550328128     Document Type: Article

References (15)

1. Cheng, T.C.E, and Gupta, M.C. (1989) Survey of scheduling research involving due-date determination decisions. European Journal of Operational Research, 38, 156-166.
2. Seidmann, A., Panwalkar, S.S. and Smith, M.L. (1981) Optimal assignment of due-dates for a single processor scheduling problem. International Journal of Production Research, 19, 393399.
3. Seidmann, A. and Smith, M.L. (1981) Due-date assignment for production systems. Management Science. 27, 571-581.
4. Panwalkar, S.S., Smith, M.L. and Seidmann, A. (1982) Common due-date assignment to minimize total penalty for the one machine sequencing problem. Operations Research, 30, 391-399.
5. Hall, N.G. (1986) Scheduling problems with generalized due dates. HE Transactions, 18, 220-222.
6. Cheng, T.C.E. and Kahlbacher, H.G. (1993) Single-machine scheduling to minimize earliness and number of tardy jobs. Journal of Optimisation Theory and Applications, 77, 563-573.
7. Kahlbacher, H.G. and Cheng, T.C.E. (1993) Parallel-machine scheduling to minimize costs of earliness and number of tardy jobs. Discrete Applied Mathematics, 47, 139-164.
8. Raman, N., Talbot, F.B. and Rachamadugu, R.V. (1989) Due date based scheduling in a general flexible manufacturing system. Journal of Operations Management, 8, 115-132.
9. Church, L.K. and Uzsoy, R. (1992) Analysis of periodic and event-driven rescheduling policies in dynamic shops. International Journal of Computer Integrated Manufacturing, 5, 153-163.
10. Wu, S.D., Storer, R.H. and Chang, P.C. (1992) A rescheduling procedure for manufacturing systems under random disruptions, in New Directions for Operations Research in Manufacturing, Fandel, G., Gulledge, T. and Jones, A. (eds.), Springer, New York, pp. 292-308.
11. Wu, S.D., Storer, R.H. and Chang, P.C. (1993) One-machine rescheduling with efficiency and stability as criteria. Computers and Operations Research, 20, 1-14.
12. Unal, A.T., Uzsoy, R. and Kiran, A.S. (1997) Rescheduling on a single machine with part-type dependent setup times and deadlines. Annals of Operations Research, 70, 93-113.
13. Lawler, E.L. (1973) Optimal sequencing of a single machine subject to precedence constraints. Management Science, 19, 544-546.
14. Du, J. and Leung, J.Y.-T. (1990) Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research, 15, 483-195.
15. Jackson, J.R. (1955) Scheduling a production line to minimize maximum tardiness. Research Report 43, Management Science Research Project, University of California, Los Angeles.