메뉴 건너뛰기




Volumn 34, Issue 1, 2010, Pages 238-243

Rescheduling problems with deteriorating jobs under disruptions

Author keywords

Deterioration; Disruption; Rescheduling; Single machine; Total completion time

Indexed keywords

DETERIORATING JOBS; DISRUPTION; INCREASING FUNCTIONS; LINEAR FUNCTIONS; POLYNOMIAL ALGORITHM; PROCESSING TIME; RESCHEDULING; RESCHEDULING PROBLEM; SINGLE MACHINE; SINGLE MACHINES; TOTAL COMPLETION TIME;

EID: 69249212487     PISSN: 0307904X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apm.2009.03.037     Document Type: Article
Times cited : (45)

References (11)
  • 1
    • 0025429963 scopus 로고
    • Scheduling deteriorating jobs on a single processor
    • Browne S., and Yechiali U. Scheduling deteriorating jobs on a single processor. Oper. Res. 38 (1990) 495-498
    • (1990) Oper. Res. , vol.38 , pp. 495-498
    • Browne, S.1    Yechiali, U.2
  • 2
    • 0032682389 scopus 로고    scopus 로고
    • Scheduling with time dependent processing times: review and extensions
    • Alidaee B., and Womer N.K. Scheduling with time dependent processing times: review and extensions. J. Oper. Res. Soc. 50 (1999) 711-720
    • (1999) J. Oper. Res. Soc. , vol.50 , pp. 711-720
    • Alidaee, B.1    Womer, N.K.2
  • 3
    • 0141859880 scopus 로고    scopus 로고
    • A concise survey of scheduling with time-dependent processing times
    • Cheng T.C.E., Ding Q., and Lin B.M.T. A concise survey of scheduling with time-dependent processing times. Eur. J. Oper. Res. 152 (2004) 1-13
    • (2004) Eur. J. Oper. Res. , vol.152 , pp. 1-13
    • Cheng, T.C.E.1    Ding, Q.2    Lin, B.M.T.3
  • 4
    • 36048929477 scopus 로고    scopus 로고
    • Single machine rescheduling with new jobs arrivals and processing time compression
    • Yang B.B. Single machine rescheduling with new jobs arrivals and processing time compression. Int. J. Adv. Manuf. Technol. 34 (2007) 378-384
    • (2007) Int. J. Adv. Manuf. Technol. , vol.34 , pp. 378-384
    • Yang, B.B.1
  • 5
    • 0031525145 scopus 로고    scopus 로고
    • Rescheduling on a single machine with part-type depend setup times and deadlines
    • Unal A.T., Uzsoy R., and Kiran A.S. Rescheduling on a single machine with part-type depend setup times and deadlines. Ann. Oper. Res. 70 (1997) 93-113
    • (1997) Ann. Oper. Res. , vol.70 , pp. 93-113
    • Unal, A.T.1    Uzsoy, R.2    Kiran, A.S.3
  • 6
    • 19744366708 scopus 로고    scopus 로고
    • Rescheduling for new orders
    • Hall N.G., and Poots C.N. Rescheduling for new orders. Oper. Res. 52 (2004) 440-453
    • (2004) Oper. Res. , vol.52 , pp. 440-453
    • Hall, N.G.1    Poots, C.N.2
  • 7
    • 34247463767 scopus 로고    scopus 로고
    • Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption
    • Yuan J., and Mu Y. Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption. Eur. J. Oper. Res. 182 (2007) 936-944
    • (2007) Eur. J. Oper. Res. , vol.182 , pp. 936-944
    • Yuan, J.1    Mu, Y.2
  • 9
    • 0035365406 scopus 로고    scopus 로고
    • NP-hard cases in scheduling deteriorating jobs on dedicated machines
    • Kononov A., and Gawiejnowicz S. NP-hard cases in scheduling deteriorating jobs on dedicated machines. J. Oper. Res. Soc. 52 (2001) 708-717
    • (2001) J. Oper. Res. Soc. , vol.52 , pp. 708-717
    • Kononov, A.1    Gawiejnowicz, S.2
  • 10
    • 0142168401 scopus 로고    scopus 로고
    • scheduling problems under linear deterioration
    • Zhao C.-L., Zhang Q.-L., and ang H.-Y. scheduling problems under linear deterioration. Acta Automat. Sin. 29 (2003) 531-535
    • (2003) Acta Automat. Sin. , vol.29 , pp. 531-535
    • Zhao, C.-L.1    Zhang, Q.-L.2    ang, H.-Y.3
  • 11
    • 0034349899 scopus 로고    scopus 로고
    • Single machine scheduling with deadlines and increasing rates of processing times
    • Cheng T.C.E., and Ding Q. Single machine scheduling with deadlines and increasing rates of processing times. Acta Inform. 36 (2000) 673-692
    • (2000) Acta Inform. , vol.36 , pp. 673-692
    • Cheng, T.C.E.1    Ding, Q.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.