Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption

European Journal of Operational Research

Volumn 182, Issue 2, 2007, Pages 936-944

  Yuan, Jinjiang ^a   Mu, Yundong ^a,b  

^a ZHENGZHOU UNIVERSITY   (China)

^b HENAN UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Disruption; Makespan; NP hard; Release dates; Rescheduling; Single machine

Indexed keywords

INDUSTRIAL MANAGEMENT; JOB ANALYSIS; OPERATIONS RESEARCH; POLYNOMIALS; PROBLEM SOLVING;

MAKESPAN; POLYNOMIAL TIME; RELEASE DATES; RESCHEDULING; SEQUENCE DISRUPTION;

SCHEDULING;

EID: 34247463767     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.07.026     Document Type: Article

References (7)

1. Brucker P. Scheduling Algorithms (2001), Springer-Verlag, Berlin
2. Graham R.L., Lawler E.L., Lenstra J.K., and Rinnooy Kan A.H.G. Optimization and approximation in deterministic machine scheduling: A survey. Annals of Discrete Mathematics 5 (1979) 287-326
3. Hall N.G., and Poots C.N. Rescheduling for new orders. Operations Research 52 (2004) 440-453
4. Blazewicz J., Ecrer K., and Weglarz J. Scheduling in Computer and Manufacturing Systems (1993), Springer-Verlag, Berlin
5. Unal A.T., Uzsoy R., and Kiran A.S. Rescheduling on a single machine with part-type depend setup times and deadlines. Annals of Operations Research 70 (1997) 93-113
6. Wu S.D., Storer R.H., and Chang P.C. A rescheduling procedure for manufacturing systems under random disruptions. In: Fandel G., Gulledge T., and Jone A. (Eds). New Directions for Operations Research in Manufacturing (1992), Springer, Berlin, Germany 292-308
7. Scharbrodt M., Steger A., and Weisser H. Approximability of scheduling with fixed jobs. Journal of Scheduling 3 (1999) 267-284