메뉴 건너뛰기
Journal of the Operational Research Society
Volumn 58, Issue 6, 2007, Pages 824-826
A note on parallel-machine scheduling with deteriorating jobs
Author keywords

Lower bound; Parallel machine scheduling; Time dependent processing time
Indexed keywords

COMPUTATIONAL COMPLEXITY; OPERATIONS RESEARCH; PROBLEM SOLVING;
EID: 34249015262     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2602208     Document Type: Article
Times cited : (7)
References (9)
  • 1
    • 0032682389 scopus 로고    scopus 로고
    • Scheduling with time dependent processing times: Review and extensions
    • Alidaee B and Womer NK (1999). Scheduling with time dependent processing times: Review and extensions. J Opl Res Soc 50: 711-720.
    • (1999) J Opl Res Soc , vol.50 , pp. 711-720
    • Alidaee, B.1    Womer, N.K.2
  • 2
    • 0003051113 scopus 로고    scopus 로고
    • Parallel machine scheduling with time-dependent processing times
    • Chen ZL (1996). Parallel machine scheduling with time-dependent processing times. Discrete Appl Math 70: 81-93.
    • (1996) Discrete Appl Math , vol.70 , pp. 81-93
    • Chen, Z.L.1
  • 3
    • 34249041000 scopus 로고    scopus 로고
    • Chen ZL (1997). Erratum: Parallel machine scheduling with time-dependent processing times. Discrete Appl Math 75: 103.
    • Chen ZL (1997). Erratum: Parallel machine scheduling with time-dependent processing times. Discrete Appl Math 75: 103.
  • 4
    • 0141859880 scopus 로고    scopus 로고
    • A concise survey of scheduling with time-dependent processing times
    • Cheng TCE, Ding Q and Lin BMT (2004). A concise survey of scheduling with time-dependent processing times. Eur J Opl Res 152: 1-13.
    • (2004) Eur J Opl Res , vol.152 , pp. 1-13
    • Cheng, T.C.E.1    Ding, Q.2    Lin, B.M.T.3
  • 5
    • 74849101820 scopus 로고
    • Optimization and approximation in deterministic sequencing and scheduling: A survey
    • Graham RL, Lawler EL, Lenstra JK and Rinnooy Kan AHG (1976). Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5: 287-326.
    • (1976) Ann Discrete Math , vol.5 , pp. 287-326
    • Graham, R.L.1    Lawler, E.L.2    Lenstra, J.K.3    Rinnooy Kan, A.H.G.4
  • 6
    • 0027885153 scopus 로고
    • Complexity of scheduling tasks with time-dependent execution times
    • Ho KIJ, Leung JYT and Wei W-D (1993). Complexity of scheduling tasks with time-dependent execution times. Information Process Lett 48: 315-320.
    • (1993) Information Process Lett , vol.48 , pp. 315-320
    • Ho, K.I.J.1    Leung, J.Y.T.2    Wei, W.-D.3
  • 7
    • 0028463787 scopus 로고
    • Scheduling jobs under simple linear deterioration
    • Mosheiov G (1994). Scheduling jobs under simple linear deterioration. Comput Opns Res 21: 653-659.
    • (1994) Comput Opns Res , vol.21 , pp. 653-659
    • Mosheiov, G.1
  • 8
    • 0141556904 scopus 로고    scopus 로고
    • Working Paper, School of Business Administration, Hebrew University, Jerusalem, Israel
    • Mosheiov G (1996). Onflow shop scheduling with deteriorating jobs. Working Paper, School of Business Administration, Hebrew University, Jerusalem, Israel.
    • (1996) Onflow shop scheduling with deteriorating jobs
    • Mosheiov, G.1
  • 9
    • 0032204974 scopus 로고    scopus 로고
    • Multi-machine scheduling with linear deterioration
    • Mosheiov G (1998). Multi-machine scheduling with linear deterioration. INFOR 36: 205-214.
    • (1998) INFOR , vol.36 , pp. 205-214
    • Mosheiov, G.1

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