Scheduling a maintenance activity and due-window assignment on a single machine

Computers and Operations Research

Volumn 36, Issue 9, 2009, Pages 2541-2545

  Mosheiov, Gur ^a   Sarig, Assaf ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Due window assignment; Earliness tardiness; Maintenance activity; Scheduling

Indexed keywords

MACHINERY; MAINTENANCE; POLYNOMIAL APPROXIMATION; SCHEDULING;

DUE-WINDOW ASSIGNMENT; EARLINESS-TARDINESS; FIXED TIME INTERVALS; JOB PROCESSING TIME; MAINTENANCE ACTIVITY; MAINTENANCE TIME; POLYNOMIAL-TIME; SINGLE MACHINES; SINGLE-MACHINE SCHEDULING; TOTAL COSTS;

WINDOWS;

EID: 60349083569     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2008.10.007     Document Type: Article

References (8)

1. Liman S.D., Panwalker S.S., and Thongmee S. Common due window size and location determination in a single machine scheduling problem. Journal of the Operational Research Society 49 (1998) 1007-1010
2. Ji M., He Y., and Cheng T.C.E. Single machine scheduling with periodic maintenance to minimize makespan. Computers & Operations Research 34 (2007) 1764-1770
3. Yang D.L., Hsu C.J., and Kuo W.H. A two machine flowshop scheduling problem with a separated maintenance constraint. Computers & Operations Research 35 (2008) 876-883
4. Lee C.-L., and Leon V.-J. Machine scheduling with a rate modifying activity. European Journal of Operational Research 129 (2001) 119-128
5. Mosheiov G., and Oron D. Due-date assignment and maintenance activity scheduling problem. Mathematical and Computer Modeling 44 (2006) 1053-1057
6. Lee C.-Y. Machine scheduling with availability constraints. In: Leung J.Y.-T. (Ed). Handbook of Scheduling: Algorithms, Models and Performance Analysis (2004), Chapman & Hall/CRC, London, UK 22-1-22-13
7. Lee C.-Y., and Chen Z.-L. Scheduling jobs and maintenance activities on parallel machines. Naval Research Logistics 47 (2000) 145-165
8. Kubzin M.A., and Strusevich V.A. Planning machine maintenance in two-machine shop scheduling. Operations Research 54 (2006) 789-800