메뉴 건너뛰기




Volumn 35, Issue 4, 2007, Pages 397-402

Single-machine scheduling problems with the effects of learning and deterioration

Author keywords

Deteriorating jobs; Learning effect; Scheduling; Single machine

Indexed keywords

PROBLEM SOLVING; SCHEDULING ALGORITHMS;

EID: 33748913175     PISSN: 03050483     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.omega.2005.07.008     Document Type: Article
Times cited : (174)

References (32)
  • 2
    • 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
  • 3
    • 0026258725 scopus 로고
    • V-shaped policies for scheduling deteriorating jobs
    • Mosheiov G. V-shaped policies for scheduling deteriorating jobs. Operations Research 39 (1991) 979-991
    • (1991) Operations Research , vol.39 , pp. 979-991
    • Mosheiov, G.1
  • 4
    • 0028463787 scopus 로고
    • Scheduling jobs under simple linear deterioration
    • Mosheiov G. 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
  • 5
    • 0028533158 scopus 로고
    • Single machine scheduling with start time dependent processing times: some solvable cases
    • Sundararaghavan P.S., and Kunnathur A.S. Single machine scheduling with start time dependent processing times: some solvable cases. European Journal of Operational Research 78 (1994) 394-403
    • (1994) European Journal of Operational Research , vol.78 , pp. 394-403
    • Sundararaghavan, P.S.1    Kunnathur, A.S.2
  • 6
    • 0001898994 scopus 로고    scopus 로고
    • The complexity of scheduling starting time dependent task with release dates
    • Cheng T.C.E., and Ding Q. The complexity of scheduling starting time dependent task with release dates. Information Processing Letters 65 (1998) 75-79
    • (1998) Information Processing Letters , vol.65 , pp. 75-79
    • Cheng, T.C.E.1    Ding, Q.2
  • 8
    • 0037203614 scopus 로고    scopus 로고
    • Minimizing the total weighted completion time of deteriorating jobs
    • Bachman A., Janiak A., and Kovalyov M.Y. Minimizing the total weighted completion time of deteriorating jobs. Information Processing Letters 81 (2002) 81-84
    • (2002) Information Processing Letters , vol.81 , pp. 81-84
    • Bachman, A.1    Janiak, A.2    Kovalyov, M.Y.3
  • 9
    • 0037204524 scopus 로고    scopus 로고
    • Three scheduling problems with deteriorating jobs to minimize the total completion time
    • Ng C.T., Cheng T.C.E., Bachman A., and Janiak A. Three scheduling problems with deteriorating jobs to minimize the total completion time. Information Processing Letters 81 (2002) 327-333
    • (2002) Information Processing Letters , vol.81 , pp. 327-333
    • Ng, C.T.1    Cheng, T.C.E.2    Bachman, A.3    Janiak, A.4
  • 10
    • 0003051113 scopus 로고    scopus 로고
    • Parallel machine scheduling with time dependent processing times
    • Chen Z.-L. Parallel machine scheduling with time dependent processing times. Discrete Applied Mathematics 70 (1996) 81-94
    • (1996) Discrete Applied Mathematics , vol.70 , pp. 81-94
    • Chen, Z.-L.1
  • 11
    • 0032204974 scopus 로고    scopus 로고
    • Multi-machine scheduling with linear deterioration
    • Mosheiov G. Multi-machine scheduling with linear deterioration. INFOR 36 (1998) 205-214
    • (1998) INFOR , vol.36 , pp. 205-214
    • Mosheiov, G.1
  • 12
    • 84867973795 scopus 로고    scopus 로고
    • Complexity analysis of job-shop scheduling with deteriorating jobs
    • Mosheiov G. Complexity analysis of job-shop scheduling with deteriorating jobs. Discrete Applied Mathematics 117 (2002) 195-209
    • (2002) Discrete Applied Mathematics , vol.117 , pp. 195-209
    • Mosheiov, G.1
  • 13
    • 85168057509 scopus 로고    scopus 로고
    • Wang J-B, Xia Z-Q. Flow shop scheduling with deteriorating jobs under dominating machines. Omega, in press.
  • 14
    • 0025700721 scopus 로고
    • Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
    • Kunnathur A.S., and Gupta S.K. Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem. European Journal of Operational Research 47 (1990) 56-64
    • (1990) European Journal of Operational Research , vol.47 , pp. 56-64
    • Kunnathur, A.S.1    Gupta, S.K.2
  • 15
    • 0029390921 scopus 로고
    • Scheduling jobs with step-deterioration: minimizing makespan on a single- and multi-machine
    • Mosheiov G. Scheduling jobs with step-deterioration: minimizing makespan on a single- and multi-machine. Computers and Industrial Engineering 28 (1995) 869-879
    • (1995) Computers and Industrial Engineering , vol.28 , pp. 869-879
    • Mosheiov, G.1
  • 16
    • 0032682389 scopus 로고    scopus 로고
    • Scheduling with time dependent processing times: review and extensions
    • Alidaee B., and Womer N.K. 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
  • 18
    • 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
  • 19
    • 85168050873 scopus 로고    scopus 로고
    • Wright TP. Factors affecting the cost of airplanes. Journal of the Aeronautical Sciences 1936 (February).
  • 21
  • 22
    • 21144435406 scopus 로고    scopus 로고
    • A bi-criterion single-machine scheduling problem with learning considerations
    • Lee W.-C., Wu C.-C., and Sung H.-J. A bi-criterion single-machine scheduling problem with learning considerations. Acta Informatica 40 (2004) 303-315
    • (2004) Acta Informatica , vol.40 , pp. 303-315
    • Lee, W.-C.1    Wu, C.-C.2    Sung, H.-J.3
  • 24
    • 3343007213 scopus 로고    scopus 로고
    • Common due date scheduling with autonomous and induced learning
    • Biskup D., and Simons D. Common due date scheduling with autonomous and induced learning. European Journal of Operational Research 159 (2004) 606-616
    • (2004) European Journal of Operational Research , vol.159 , pp. 606-616
    • Biskup, D.1    Simons, D.2
  • 25
    • 12144249183 scopus 로고    scopus 로고
    • Note on scheduling with general learning curves to minimize the number of tardy jobs
    • Mosheiov G., and Sidney J.B. Note on scheduling with general learning curves to minimize the number of tardy jobs. Journal of the Operational Research Society 56 (2005) 110-112
    • (2005) Journal of the Operational Research Society , vol.56 , pp. 110-112
    • Mosheiov, G.1    Sidney, J.B.2
  • 26
    • 85168053547 scopus 로고    scopus 로고
    • Wang J-B, Xia Z-Q. Flow shop scheduling with a learning effect. Journal of the Operational Research Society, in press.
  • 28
    • 33744731083 scopus 로고    scopus 로고
    • A note on deteriorating jobs and learning in single-machine scheduling problems
    • Lee W.-C. A note on deteriorating jobs and learning in single-machine scheduling problems. International Journal of Business and Economics 3 (2004) 83-89
    • (2004) International Journal of Business and Economics , vol.3 , pp. 83-89
    • Lee, W.-C.1
  • 30
    • 0026868478 scopus 로고
    • Computational survey of univariate and multivariate learning curve models
    • Badiru A.B. Computational survey of univariate and multivariate learning curve models. IEEE Transactions on Engineering Management 39 (1992) 176-188
    • (1992) IEEE Transactions on Engineering Management , vol.39 , pp. 176-188
    • Badiru, A.B.1
  • 32
    • 0017921371 scopus 로고
    • The single machine problem with quadratic penalty function of completion times: a branch-and-bound solution
    • Townsend W. The single machine problem with quadratic penalty function of completion times: a branch-and-bound solution. Management Science 24 (1978) 530-534
    • (1978) Management Science , vol.24 , pp. 530-534
    • Townsend, W.1


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