A production scheduling strategy with a common due window

Computers and Industrial Engineering

Volumn 53, Issue 2, 2007, Pages 215-221

  Wu, Yue ^a   Lai, K K ^b  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Due window; Earliness Tardiness; Just In Time (JIT); Production scheduling

Indexed keywords

DATA ACQUISITION; INVENTORY CONTROL; JUST IN TIME PRODUCTION; OPTIMIZATION; POLYNOMIAL APPROXIMATION; SCHEDULING;

DUE WINDOW; PRODUCTION SCHEDULING; PRODUCTION SCHEDULING PROBLEM;

PRODUCTION ENGINEERING;

EID: 34548201709     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2007.06.012     Document Type: Article

References (6)

1. Anger, F. D., Lee, C. Y., & Martin-Vega, L. A. (1986). Single machine scheduling with tight windows. Research Report, 86-168, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL.
2. Cheng T.C.E. Optimal common due-date with limited completion time deviation. Computer and Operations Research 15 2 (1988) 91-96
3. Koulamas C. Single-machine scheduling with time windows and earliness/tardiness penalties. European Journal of Operational Research 91 1 (1996) 190-202
4. Lee, C. Y. (1991). Earliness-tardiness scheduling problems with constant size of due-date window. Research Report, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL.
5. Liman S.D., and Ramaswarmy S. Earliness-tardiness scheduling problems with a common delivery window. Operations Research Letters 15 4 (1994) 195-203
6. Weng M.X., and Ventura J. A single machine earliness-tardiness scheduling about a common due date with tolerances. International Journal of Production Economics 42 3 (1995) 217-227