메뉴 건너뛰기




Volumn 131, Issue 2, 2011, Pages 747-751

Scheduling deteriorating jobs with CON/SLK due date assignment on a single machine

Author keywords

CON SLK due date assignment; Deteriorating jobs; Scheduling

Indexed keywords

DETERIORATING JOBS; DUE DATES; DUE-DATE ASSIGNMENT; INCREASING FUNCTIONS; POLYNOMIAL-TIME ALGORITHMS; PROCESSING TIME; SINGLE MACHINES; WEIGHTED NUMBER;

EID: 79954418013     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2011.02.029     Document Type: Article
Times cited : (40)

References (24)
  • 1
    • 0032682389 scopus 로고    scopus 로고
    • Scheduling with time dependent processing times: Review and extensions
    • B. Alidaee, and N.K. Womer Scheduling with time dependent processing times: review and extensions Journal of the Operational Research Society 50 1999 711 720
    • (1999) Journal of the Operational Research Society , vol.50 , pp. 711-720
    • Alidaee, B.1    Womer, N.K.2
  • 5
    • 0024303531 scopus 로고
    • Survey of scheduling research involving due date determination decisions
    • T.C.E. Cheng, and M.C. Gupta Survey of scheduling research involving due date determination decisions European Journal of Operational Research 38 1989 156 166
    • (1989) European Journal of Operational Research , vol.38 , pp. 156-166
    • Cheng, T.C.E.1    Gupta, M.C.2
  • 7
    • 34547359924 scopus 로고    scopus 로고
    • Due-date assignment and parallel-machine scheduling with deteriorating jobs
    • DOI 10.1057/palgrave.jors.2602225, PII 2602225
    • T.C.E. Cheng, L.Y. Kang, and C.T. Ng Due-date assignment and parallel-machine scheduling with deteriorating jobs Journal of the Operational Research Society 58 2007 1103 1108 (Pubitemid 47150130)
    • (2007) Journal of the Operational Research Society , vol.58 , Issue.8 , pp. 1103-1108
    • Cheng, T.C.E.1    Kang, L.Y.2    Ng, C.T.3
  • 10
    • 62549112638 scopus 로고    scopus 로고
    • Single machine scheduling and due date assignment with positionally dependent processing times
    • V.S. Gordon, and V.A. Strusevich Single machine scheduling and due date assignment with positionally dependent processing times European Journal of Operational Research 198 2009 57 62
    • (2009) European Journal of Operational Research , vol.198 , pp. 57-62
    • Gordon, V.S.1    Strusevich, V.A.2
  • 12
    • 0008310557 scopus 로고    scopus 로고
    • Earliness-tardiness scheduling around almost equal due dates
    • J.A. Hoogeveen, and S.L. van de Velde Earliness-stardiness scheduling around almost equal due dates Informs Journal on Computing 9 1997 92 99 (Pubitemid 127695174)
    • (1997) INFORMS Journal on Computing , vol.9 , Issue.1 , pp. 92-99
    • Hoogeveen, J.A.1    Van De Velde, S.L.2
  • 14
    • 38249000672 scopus 로고
    • Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
    • H.G. Kahlbacher, and T.C.E. Cheng Parallel machine scheduling to minimize costs for earliness and number of tardy jobs Discrete Applied Mathematics 47 1993 139 164
    • (1993) Discrete Applied Mathematics , vol.47 , pp. 139-164
    • Kahlbacher, H.G.1    Cheng, T.C.E.2
  • 15
    • 39649123270 scopus 로고    scopus 로고
    • Parallel-machine scheduling with time dependent processing times
    • W.H. Kuo, and D.L. Yang Parallel-machine scheduling with time dependent processing times Theoretical Computer Science 393 2008 204 210
    • (2008) Theoretical Computer Science , vol.393 , pp. 204-210
    • Kuo, W.H.1    Yang, D.L.2
  • 17
    • 0028463787 scopus 로고
    • Scheduling jobs under simple linear deterioration
    • G. Mosheiov Scheduling jobs under simple linear deterioration Computers and Operations Research 21 1994 653 659
    • (1994) Computers and Operations Research , vol.21 , pp. 653-659
    • Mosheiov, G.1
  • 18
    • 0037204524 scopus 로고    scopus 로고
    • Three scheduling problems with deteriorating jobs to minimize the total completion time
    • DOI 10.1016/S0020-0190(01)00244-7, PII S0020019001002447
    • C.T. Ng, T.C.E. Cheng, A. Bachman, and A. Janiak Three scheduling problems with deteriorating jobs to minimize the total completion time Information Processing Letters 81 2002 327 333 (Pubitemid 34078195)
    • (2002) Information Processing Letters , vol.81 , Issue.6 , pp. 327-333
    • Ng, C.T.1    Cheng, T.C.E.2    Bachman, A.3    Janiak, A.4
  • 19
    • 77956094331 scopus 로고    scopus 로고
    • Preemptive scheduling with simple linear deterioration on a single machine
    • C.T. Ng, S.S. Li, T.C.E. Cheng, and J.J. Yuan Preemptive scheduling with simple linear deterioration on a single machine Theoretical Computer Science 411 2010 3578 3586
    • (2010) Theoretical Computer Science , vol.411 , pp. 3578-3586
    • Ng, C.T.1    Li, S.S.2    Cheng, T.C.E.3    Yuan, J.J.4
  • 21
    • 70449520162 scopus 로고    scopus 로고
    • Scheduling and due date assignment to minimize earliness, tardiness, holding, due date assignment and batch delivery costs
    • D. Shabtay Scheduling and due date assignment to minimize earliness, tardiness, holding, due date assignment and batch delivery costs International Journal of Production Economics 123 2010 235 242
    • (2010) International Journal of Production Economics , vol.123 , pp. 235-242
    • Shabtay, D.1
  • 22
    • 61449114951 scopus 로고    scopus 로고
    • Optimal due date assignment and resource allocation to minimize the weighted number of tardy jobs on a single machine
    • D. Shabtay, and G. Steiner Optimal due date assignment and resource allocation to minimize the weighted number of tardy jobs on a single machine Manufacturing and Service Operations Management 9 2007 332 350
    • (2007) Manufacturing and Service Operations Management , vol.9 , pp. 332-350
    • Shabtay, D.1    Steiner, G.2
  • 23
    • 0020500356 scopus 로고
    • Due date selection procedures for job-shop simulation
    • DOI 10.1016/0360-8352(83)90029-3
    • M.L. Smith, and A. Seidmann Due date selection procedures for job-shop simulation Computers and Industrial Engineering 7 1983 199 207 (Pubitemid 13559341)
    • (1983) Computers and Industrial Engineering , vol.7 , Issue.3 , pp. 199-207
    • Smith, M.L.1    Seidmann, A.2


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