메뉴 건너뛰기




Volumn 33, Issue 11-12, 2007, Pages 1237-1243

Minimizing the total weighted completion time on a single machine under linear deterioration

Author keywords

Linear deterioration; Scheduling; Start time dependency

Indexed keywords

HEURISTIC ALGORITHMS; JOB ANALYSIS; OPTIMIZATION; PROBLEM SOLVING;

EID: 34547803718     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-006-0565-8     Document Type: Article
Times cited : (59)

References (15)
  • 1
    • 0032136143 scopus 로고    scopus 로고
    • Scheduling deteriorating jobs to minimize makespan
    • Kubiak W, van de Velde SL (1998) Scheduling deteriorating jobs to minimize makespan. Nav Res Logist 45:511-523
    • (1998) Nav Res Logist , vol.45 , pp. 511-523
    • Kubiak, W.1    Van De Velde, S.L.2
  • 2
    • 0028463787 scopus 로고
    • Scheduling jobs under simple linear deterioration
    • 6
    • Mosheiov G (1994) Scheduling jobs under simple linear deterioration. Comput Oper Res 21(6):653-659
    • (1994) Comput Oper Res , vol.21 , pp. 653-659
    • Mosheiov, G.1
  • 3
    • 0025429963 scopus 로고
    • Scheduling deteriorating jobs on a single processor
    • Browne S, Yechiali U (1990) Scheduling deteriorating jobs on a single processor. Oper Res 38 :495-498
    • (1990) Oper Res , vol.38 , pp. 495-498
    • Browne, S.1    Yechiali, U.2
  • 4
    • 0032682389 scopus 로고    scopus 로고
    • Scheduling with time dependent processing times: Review and extensions
    • Alidaee B, Womer NK (1999) Scheduling with time dependent processing times: review and extensions. J Oper Res Soc 50:711-772
    • (1999) J Oper Res Soc , vol.50 , pp. 711-772
    • Alidaee, B.1    Womer, N.K.2
  • 5
    • 0141859880 scopus 로고    scopus 로고
    • A concise survey of scheduling with time-dependent processing times
    • Cheng TCE, Ding Q, Lin BMT (2004) A concise survey of scheduling with time-dependent processing times. Eur J Oper Res 152: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
  • 6
    • 0028533158 scopus 로고
    • Single machine scheduling with start time dependent processing time: Some solvable cases
    • 3
    • Sundararaghavan PS, Kunnathur AS (1994) Single machine scheduling with start time dependent processing time: some solvable cases. Eur J Oper Res 78(3):394-403
    • (1994) Eur J Oper Res , vol.78 , pp. 394-403
    • Sundararaghavan, P.S.1    Kunnathur, A.S.2
  • 7
    • 0030305471 scopus 로고    scopus 로고
    • Λ-shaped policies to schedule deteriorating jobs
    • Mosheiov G (1996) Λ-shaped policies to schedule deteriorating jobs. J Oper Res Soc 47:1184-1191
    • (1996) J Oper Res Soc , vol.47 , pp. 1184-1191
    • Mosheiov, G.1
  • 8
    • 0036602498 scopus 로고    scopus 로고
    • Scheduling start time dependent jobs to minimize the total weighted completion time
    • 6
    • Bachman A, Cheng TCE, Janiak A, Ng CT (2002) Scheduling start time dependent jobs to minimize the total weighted completion time. J Oper Res Soc 53(6): 688-693
    • (2002) J Oper Res Soc , vol.53 , pp. 688-693
    • Bachman, A.1    Cheng, T.C.E.2    Janiak, A.3    Ng, C.T.4
  • 9
    • 0037203614 scopus 로고    scopus 로고
    • Minimizing the total weighted completion time of deteriorating jobs
    • 2
    • Bachman A, Janiak A, Kovalyov MY (2002) Minimizing the total weighted completion time of deteriorating jobs. Inf Process Lett 81(2):81-84
    • (2002) Inf Process Lett , vol.81 , pp. 81-84
    • Bachman, A.1    Janiak, A.2    Kovalyov, M.Y.3
  • 10
    • 34547753265 scopus 로고    scopus 로고
    • A branch and bound for the reentrant permutation flow-shop scheduling problem
    • in press
    • Chen JS (2005) A branch and bound for the reentrant permutation flow-shop scheduling problem. Int J Adv Manuf Technol (in press)
    • (2005) Int J Adv Manuf Technol
    • Chen, J.S.1
  • 11
    • 20344369817 scopus 로고    scopus 로고
    • An algorithm for scheduling batches of parts in a multi-cell flexible manufacturing system
    • Das SR, Canel C (2005) An algorithm for scheduling batches of parts in a multi-cell flexible manufacturing system. Int J Prod Econ 97:247-262
    • (2005) Int J Prod Econ , vol.97 , pp. 247-262
    • Das, S.R.1    Canel, C.2
  • 12
    • 27544509423 scopus 로고    scopus 로고
    • Single machine scheduling with multiple objectives in semiconductor manufacturing
    • Gupta AK, Sivakumar AI (2005) Single machine scheduling with multiple objectives in semiconductor manufacturing. Int J Adv Manuf Technol 26:950-958
    • (2005) Int J Adv Manuf Technol , vol.26 , pp. 950-958
    • Gupta, A.K.1    Sivakumar, A.I.2
  • 13
    • 31644451948 scopus 로고    scopus 로고
    • Job shop scheduling techniques in semiconductor manufacturing
    • (11/12)
    • Gupta AK, Sivakumar AI (2005) Job shop scheduling techniques in semiconductor manufacturing. Int J Adv Manuf Technol 27(11/12):1163-1169
    • (2005) Int J Adv Manuf Technol , vol.27 , pp. 1163-1169
    • Gupta, A.K.1    Sivakumar, A.I.2
  • 14
    • 0034325430 scopus 로고    scopus 로고
    • Minimizing maximum lateness under linear deterioration
    • Bachman A, Janiak A (2000) Minimizing maximum lateness under linear deterioration. Eur J Oper Res 126:557-566
    • (2000) Eur J Oper Res , vol.126 , pp. 557-566
    • Bachman, A.1    Janiak, A.2
  • 15
    • 0142246404 scopus 로고    scopus 로고
    • Minimization of maximum lateness under linear deterioration
    • Hsu YS, Lin BMT (2003) Minimization of maximum lateness under linear deterioration. OMEGA Int J Manage S 31:459-469
    • (2003) OMEGA Int J Manage S , vol.31 , pp. 459-469
    • Hsu, Y.S.1    Lin, B.M.T.2


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