메뉴 건너뛰기




Volumn 59, Issue 7, 2008, Pages 997-1003

A due-window assignment problem with position-dependent processing times

Author keywords

Due window; Earliness tardiness; Position dependent processing times; Scheduling

Indexed keywords

COMBINATORIAL OPTIMIZATION; SCHEDULING;

EID: 44849113738     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2602439     Document Type: Article
Times cited : (46)

References (9)
  • 1
    • 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
  • 2
    • 0037118177 scopus 로고    scopus 로고
    • A survey of the state of the art of common due date assignment and scheduling research
    • Gordon V, Proth JM and Chu C (2002). A survey of the state of the art of common due date assignment and scheduling research. Eur J Opl Res 139: 1-25.
    • (2002) Eur J Opl Res , vol.139 , pp. 1-25
    • Gordon, V.1    Proth, J.M.2    Chu, C.3
  • 3
    • 0030212471 scopus 로고    scopus 로고
    • Determination of common due window location in a single machine scheduling problem
    • Liman SD, Panwalkar SS and Thongmee S (1996). Determination of common due window location in a single machine scheduling problem. Eur J Opl Res 93: 68-74.
    • (1996) Eur J Opl Res , vol.93 , pp. 68-74
    • Liman, S.D.1    Panwalkar, S.S.2    Thongmee, S.3
  • 4
    • 0032167289 scopus 로고    scopus 로고
    • Common due window size and location determination in a single machine scheduling problem
    • Liman SD, Panwalkar SS and Thongmee S (1998). Common due window size and location determination in a single machine scheduling problem. J Opl Res Soc 49: 1007-1010.
    • (1998) J Opl Res Soc , vol.49 , pp. 1007-1010
    • Liman, S.D.1    Panwalkar, S.S.2    Thongmee, S.3
  • 5
    • 6344261626 scopus 로고    scopus 로고
    • Due-window assignment with unit processing-time jobs
    • Mosheiov G and Oron D (2004). Due-window assignment with unit processing-time jobs. Naval Res Logist 51: 1005-1017.
    • (2004) Naval Res Logist , vol.51 , pp. 1005-1017
    • Mosheiov, G.1    Oron, D.2
  • 6
    • 0037449223 scopus 로고    scopus 로고
    • Scheduling with general job-dependent learning curves
    • Mosheiov G and Sidney J (2003). Scheduling with general job-dependent learning curves. Eur J Opl Res 147: 665-670.
    • (2003) Eur J Opl Res , vol.147 , pp. 665-670
    • Mosheiov, G.1    Sidney, J.2
  • 7
    • 0020103079 scopus 로고
    • Common due-date assignment to minimize total penalty for the one machine scheduling problem
    • Panwalkar SS, Smith MS and Seidmann A (1982). Common due-date assignment to minimize total penalty for the one machine scheduling problem. Opns Res 30: 391-399.
    • (1982) Opns Res , vol.30 , pp. 391-399
    • Panwalkar, S.S.1    Smith, M.S.2    Seidmann, A.3
  • 8
    • 84989738099 scopus 로고
    • Scheduling about a large common due-date with tolerance to minimized mean absolute deviation of completion times
    • Weng MX and Ventura JA (1994). Scheduling about a large common due-date with tolerance to minimized mean absolute deviation of completion times. Naval Res Logist 41: 843-851.
    • (1994) Naval Res Logist , vol.41 , pp. 843-851
    • Weng, M.X.1    Ventura, J.A.2
  • 9
    • 0000041767 scopus 로고    scopus 로고
    • A note on 'common due-window scheduling'
    • Weng MX and Ventura JA (1996). A note on 'common due-window scheduling'. Prod Opl Mngt 5: 194-200.
    • (1996) Prod Opl Mngt , vol.5 , pp. 194-200
    • Weng, M.X.1    Ventura, J.A.2


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