메뉴 건너뛰기




Volumn 205, Issue 2, 2010, Pages 479-482

A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times

Author keywords

Scheduling; Single machine; Variable processing times

Indexed keywords

JOB PROCESSING TIME; SINGLE MACHINES; SINGLE-MACHINE SCHEDULING; SOLUTION APPROACH; TOTAL PROCESSING TIME; UNIFIED ANALYSIS; VARIABLE PROCESSING TIME; VARIABLE PROCESSING TIMES;

EID: 76949083730     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2009.12.013     Document Type: Article
Times cited : (20)

References (21)
  • 1
    • 0027906633 scopus 로고
    • Two parallel machine sequencing problems involving controllable job processing times
    • Alidaee B., and Ahmadian A. Two parallel machine sequencing problems involving controllable job processing times. European Journal of Operational Research 70 (1993) 335-341
    • (1993) European Journal of Operational Research , vol.70 , pp. 335-341
    • Alidaee, B.1    Ahmadian, A.2
  • 2
    • 0024480571 scopus 로고
    • Simultaneous minimization of mean and variation of flow-time and waiting time in single machine systems
    • Bagchi U.B. Simultaneous minimization of mean and variation of flow-time and waiting time in single machine systems. Operations Research 37 (1989) 118-125
    • (1989) Operations Research , vol.37 , pp. 118-125
    • Bagchi, U.B.1
  • 3
    • 0345201636 scopus 로고    scopus 로고
    • Single-machine scheduling with learning considerations
    • Biskup D. Single-machine scheduling with learning considerations. European Journal of Operational Research 115 (1999) 173-178
    • (1999) European Journal of Operational Research , vol.115 , pp. 173-178
    • Biskup, D.1
  • 4
    • 38149027740 scopus 로고    scopus 로고
    • A state-of-the-art review of scheduling with learning effects
    • Biskup D. A state-of-the-art review of scheduling with learning effects. European Journal of Operational Research 188 (2008) 315-329
    • (2008) European Journal of Operational Research , vol.188 , pp. 315-329
    • Biskup, D.1
  • 5
    • 0035852851 scopus 로고    scopus 로고
    • Common due date assignment for scheduling on a single machine with jointly reducible processing times
    • Biskup D., and Jahnke D. Common due date assignment for scheduling on a single machine with jointly reducible processing times. International Journal of Production Economics 69 (2001) 317-322
    • (2001) International Journal of Production Economics , vol.69 , pp. 317-322
    • Biskup, D.1    Jahnke, D.2
  • 6
    • 0025429963 scopus 로고
    • Scheduling deteriorating jobs on a single processor
    • Browne S., and Yechiali U. Scheduling deteriorating jobs on a single processor. Operations Research 38 (1990) 495-498
    • (1990) Operations Research , vol.38 , pp. 495-498
    • Browne, S.1    Yechiali, U.2
  • 7
    • 0030145046 scopus 로고    scopus 로고
    • Due-date assignment and single machine scheduling with compressible processing times
    • Cheng T.C.E., Ogaz C., and Qi X.D. Due-date assignment and single machine scheduling with compressible processing times. International Journal of Production Economics 43 (1996) 29-35
    • (1996) International Journal of Production Economics , vol.43 , pp. 29-35
    • Cheng, T.C.E.1    Ogaz, C.2    Qi, X.D.3
  • 9
    • 33746239045 scopus 로고    scopus 로고
    • Minimizing the total completion time in a single machine scheduling problem with a time-dependent learning effect
    • Kuo W.-H., and Yang D.-L. Minimizing the total completion time in a single machine scheduling problem with a time-dependent learning effect. European Journal of Operational Research 174 (2006) 1184-1190
    • (2006) European Journal of Operational Research , vol.174 , pp. 1184-1190
    • Kuo, W.-H.1    Yang, D.-L.2
  • 11
    • 0031491808 scopus 로고    scopus 로고
    • A single machine scheduling problem with common due window and controllable processing times
    • Liman S.D., Panwalkar S.S., and Thongmee S. A single machine scheduling problem with common due window and controllable processing times. Annals of Operations Research 70 (1997) 145-154
    • (1997) Annals of Operations Research , vol.70 , pp. 145-154
    • Liman, S.D.1    Panwalkar, S.S.2    Thongmee, S.3
  • 12
    • 0141640100 scopus 로고
    • Convex resource allocation problems on directed acyclic graphs: Duality, complexity, special cases and extensions
    • Monma C.L., Schrijver A., Todd M.J., and Wei V.K. Convex resource allocation problems on directed acyclic graphs: Duality, complexity, special cases and extensions. Mathematics of Operations Research 15 (1990) 736-748
    • (1990) Mathematics of Operations Research , vol.15 , pp. 736-748
    • Monma, C.L.1    Schrijver, A.2    Todd, M.J.3    Wei, V.K.4
  • 14
    • 0037410951 scopus 로고    scopus 로고
    • Single machine scheduling with a variable common due date and resource-dependent processing times
    • Ng C.T.D., Cheng T.C.E., Kovalyov M.Y., and Lam S.S. Single machine scheduling with a variable common due date and resource-dependent processing times. Computers & Operations Research 30 (2003) 1173-1185
    • (2003) Computers & Operations Research , vol.30 , pp. 1173-1185
    • Ng, C.T.D.1    Cheng, T.C.E.2    Kovalyov, M.Y.3    Lam, S.S.4
  • 16
    • 0020103079 scopus 로고
    • Common due date assignment to minimize total penalty for the one machine scheduling problem
    • Panwalkar S.S., Smith M.L., and Seidman A. Common due date assignment to minimize total penalty for the one machine scheduling problem. Operations Research 30 (1982) 391-399
    • (1982) Operations Research , vol.30 , pp. 391-399
    • Panwalkar, S.S.1    Smith, M.L.2    Seidman, A.3
  • 17
    • 34547404222 scopus 로고    scopus 로고
    • A survey of scheduling with controllable processing times
    • Shabtay D., and Steiner G. A survey of scheduling with controllable processing times. Discrete Applied Mathematics 155 (2007) 1643-1666
    • (2007) Discrete Applied Mathematics , vol.155 , pp. 1643-1666
    • Shabtay, D.1    Steiner, G.2
  • 18
    • 61449114951 scopus 로고    scopus 로고
    • Optimal due date assignment and resource allocation to minimize the weighted number of tardy jobs on a single machine
    • Shabtay D., and Steiner G. Optimal due date assignment and resource allocation to minimize the weighted number of tardy jobs on a single machine. Manufacturing & Service Operations Management 9 (2007) 332-350
    • (2007) Manufacturing & Service Operations Management , vol.9 , pp. 332-350
    • Shabtay, D.1    Steiner, G.2
  • 19
    • 38749154324 scopus 로고    scopus 로고
    • The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
    • Shabtay D., and Steiner G. The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times. Annals of Operations Research 159 (2008) 25-40
    • (2008) Annals of Operations Research , vol.159 , pp. 25-40
    • Shabtay, D.1    Steiner, G.2
  • 20
    • 0019055358 scopus 로고
    • Two single-machine sequencing problems involving controllable processing times
    • Vickson R.G. Two single-machine sequencing problems involving controllable processing times. AIIE Transactions 12 (1980) 258-262
    • (1980) AIIE Transactions , vol.12 , pp. 258-262
    • Vickson, R.G.1
  • 21
    • 33750462332 scopus 로고    scopus 로고
    • Single machine scheduling problems with controllable processing times and total absolute differences penalties
    • Wang J.B., and Xia Z.Q. Single machine scheduling problems with controllable processing times and total absolute differences penalties. European Journal of Operational Research 177 (2007) 638-645
    • (2007) European Journal of Operational Research , vol.177 , pp. 638-645
    • Wang, J.B.1    Xia, Z.Q.2


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