메뉴 건너뛰기




Volumn 33, Issue 10, 2009, Pages 3848-3853

Learning effect and deteriorating jobs in the single machine scheduling problems

Author keywords

Deteriorating jobs; Learning effect; Scheduling; Single machine

Indexed keywords

COMPLETION TIME; DETERIORATING JOBS; JOB PROCESSING TIME; LEARNING EFFECT; LEARNING EFFECTS; MAKESPAN; MAXIMUM LATENESS; MINIMIZATION PROBLEMS; OBJECTIVE FUNCTIONS; OPTIMAL SEQUENCE; PROCESSING TIME; SINGLE MACHINE; SINGLE MACHINE SCHEDULING PROBLEMS; TOTAL COMPLETION TIME; TOTAL WEIGHTED COMPLETION TIME;

EID: 67349089037     PISSN: 0307904X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apm.2009.01.004     Document Type: Article
Times cited : (63)

References (28)
  • 1
    • 0345201636 scopus 로고    scopus 로고
    • Single-machine scheduling with learning considerations
    • Biskup D. Single-machine scheduling with learning considerations. Eur. J. Operat. Res. 115 (1999) 173-178
    • (1999) Eur. J. Operat. Res. , vol.115 , pp. 173-178
    • Biskup, D.1
  • 2
    • 0027885153 scopus 로고
    • Complexity of scheduling tasks with time-dependent execution times
    • Ho K.I.-J., Leung J.Y.-T., and Wei W.-D. Complexity of scheduling tasks with time-dependent execution times. Inform. Process. Lett. 48 (1993) 315-320
    • (1993) Inform. Process. Lett. , vol.48 , pp. 315-320
    • Ho, K.I.-J.1    Leung, J.Y.-T.2    Wei, W.-D.3
  • 3
    • 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. Eur. J. Operat. Res. 47 (1990) 56-64
    • (1990) Eur. J. Operat. Res. , vol.47 , pp. 56-64
    • Kunnathur, A.S.1    Gupta, S.K.2
  • 4
    • 0026258725 scopus 로고
    • V-shaped policies for scheduling deteriorating jobs
    • Mosheiov G. V-shaped policies for scheduling deteriorating jobs. Operat. Res. 39 (1991) 979-991
    • (1991) Operat. Res. , vol.39 , pp. 979-991
    • Mosheiov, G.1
  • 5
    • 0028463787 scopus 로고
    • Scheduling jobs under simple linear deterioration
    • Mosheiov G. Scheduling jobs under simple linear deterioration. Comput. Operat. Res. 21 (1994) 653-659
    • (1994) Comput. Operat. Res. , vol.21 , pp. 653-659
    • Mosheiov, G.1
  • 6
    • 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. Eur. J. Operat. Res. 78 (1994) 394-403
    • (1994) Eur. J. Operat. Res. , vol.78 , pp. 394-403
    • Sundararaghavan, P.S.1    Kunnathur, A.S.2
  • 7
    • 0025429963 scopus 로고
    • Scheduling deteriorating jobs on a single processor
    • Browne S., and Yechiali U. Scheduling deteriorating jobs on a single processor. Operat. Res. 38 (1990) 495-498
    • (1990) Operat. Res. , vol.38 , pp. 495-498
    • Browne, S.1    Yechiali, U.2
  • 8
    • 0034325430 scopus 로고    scopus 로고
    • Minimizing maximum lateness under linear deterioration
    • Bachman A., and Janiak A. Minimizing maximum lateness under linear deterioration. Eur. J. Operat. Res. 126 (2000) 557-566
    • (2000) Eur. J. Operat. Res. , vol.126 , pp. 557-566
    • Bachman, A.1    Janiak, A.2
  • 9
    • 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. Inform. Process. Lett. 81 2 (2002) 81-84
    • (2002) Inform. Process. Lett. , vol.81 , Issue.2 , pp. 81-84
    • Bachman, A.1    Janiak, A.2    Kovalyov, M.Y.3
  • 10
    • 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. Inform. Process. Lett. 81 (2002) 327-333
    • (2002) Inform. Process. Lett. , vol.81 , pp. 327-333
    • Ng, C.T.1    Cheng, T.C.E.2    Bachman, A.3    Janiak, A.4
  • 11
    • 0036602498 scopus 로고    scopus 로고
    • Scheduling start time dependent jobs to minimize the total weighted completion time
    • Bachman A., Cheng T.C.E., Janiak A., and Ng C.T. Scheduling start time dependent jobs to minimize the total weighted completion time. J. Operat. Res. Soc. 53 (2002) 688-693
    • (2002) J. Operat. Res. Soc. , vol.53 , pp. 688-693
    • Bachman, A.1    Cheng, T.C.E.2    Janiak, A.3    Ng, C.T.4
  • 13
    • 36849012070 scopus 로고    scopus 로고
    • Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
    • Wang J.-B., Ng C.T., and Cheng T.C.E. Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint. Comput. Operat. Res. 35 (2008) 2684-2693
    • (2008) Comput. Operat. Res. , vol.35 , pp. 2684-2693
    • Wang, J.-B.1    Ng, C.T.2    Cheng, T.C.E.3
  • 14
    • 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. J. Operat. Res. Soc. 50 (1999) 711-720
    • (1999) J. Operat. Res. Soc. , vol.50 , pp. 711-720
    • Alidaee, B.1    Womer, N.K.2
  • 15
    • 0141859880 scopus 로고    scopus 로고
    • A concise survey of scheduling with time-dependent processing times
    • Cheng T.C.E., Ding Q., and Lin B.M.T. A concise survey of scheduling with time-dependent processing times. Eur. J. Operat. Res. 152 (2004) 1-13
    • (2004) Eur. J. Operat. Res. , vol.152 , pp. 1-13
    • Cheng, T.C.E.1    Ding, Q.2    Lin, B.M.T.3
  • 16
    • 0034563358 scopus 로고    scopus 로고
    • Single machine scheduling with learning effect considerations
    • Cheng T.C.E., and Wang G. Single machine scheduling with learning effect considerations. Ann. Operat. Res. 98 (2000) 273-290
    • (2000) Ann. Operat. Res. , vol.98 , pp. 273-290
    • Cheng, T.C.E.1    Wang, G.2
  • 17
    • 0035427775 scopus 로고    scopus 로고
    • Scheduling problems with a learning effect
    • Mosheiov G. Scheduling problems with a learning effect. Eur. J. Operat. Res. 132 (2001) 687-693
    • (2001) Eur. J. Operat. Res. , vol.132 , pp. 687-693
    • Mosheiov, G.1
  • 18
    • 0035493960 scopus 로고    scopus 로고
    • Parallel machine scheduling with a learning effect
    • Mosheiov G. Parallel machine scheduling with a learning effect. J. Operat. Res. Soc. 52 (2001) 1165-1169
    • (2001) J. Operat. Res. Soc. , vol.52 , pp. 1165-1169
    • Mosheiov, G.1
  • 19
    • 0037449223 scopus 로고    scopus 로고
    • Scheduling with general job-dependent learning curves
    • Mosheiov G., and Sidney J.B. Scheduling with general job-dependent learning curves. Eur. J. Operat. Res. 147 (2003) 665-670
    • (2003) Eur. J. Operat. Res. , vol.147 , pp. 665-670
    • Mosheiov, G.1    Sidney, J.B.2
  • 20
    • 2342451996 scopus 로고    scopus 로고
    • Scheduling jobs with position-dependent processing times
    • Bachman A., and Janiak A. Scheduling jobs with position-dependent processing times. J. Operat. Res. Soc. 55 (2004) 257-264
    • (2004) J. Operat. Res. Soc. , vol.55 , pp. 257-264
    • Bachman, A.1    Janiak, A.2
  • 21
    • 38149027740 scopus 로고    scopus 로고
    • A state-of-the-art review on scheduling with learning effects
    • Biskup D. A state-of-the-art review on scheduling with learning effects. Eur. J. Operat. Res. 188 (2008) 315-329
    • (2008) Eur. J. Operat. Res. , vol.188 , pp. 315-329
    • Biskup, D.1
  • 22
    • 0036226257 scopus 로고    scopus 로고
    • Task complexity effects on between-individual learning/forgetting variability
    • Nembhard D.A., and Osothsilp N. Task complexity effects on between-individual learning/forgetting variability. Int. J. Ind. Ergonom. 29 (2002) 297C306
    • (2002) Int. J. Ind. Ergonom. , vol.29
    • Nembhard, D.A.1    Osothsilp, N.2
  • 23
    • 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. Int. J. Bus. Econ. 3 (2004) 83-89
    • (2004) Int. J. Bus. Econ. , vol.3 , pp. 83-89
    • Lee, W.-C.1
  • 24
    • 0026868478 scopus 로고
    • Computational survey of univariate and multivariate learning curve models
    • Badiru A.B. Computational survey of univariate and multivariate learning curve models. IEEE Trans. Eng. Manage. 39 (1992) 176-188
    • (1992) IEEE Trans. Eng. Manage. , vol.39 , pp. 176-188
    • Badiru, A.B.1
  • 25
    • 33749005938 scopus 로고    scopus 로고
    • A note on scheduling problems with learning effect and deteriorating jobs
    • Wang J.-B. A note on scheduling problems with learning effect and deteriorating jobs. Int. J. Syst. Sci. 37 (2006) 827-833
    • (2006) Int. J. Syst. Sci. , vol.37 , pp. 827-833
    • Wang, J.-B.1
  • 26
    • 0014563454 scopus 로고
    • On start-up or learning curves: an expanded view
    • Pegels C.C. On start-up or learning curves: an expanded view. AIIE Trans. 1 (1969) 316-322
    • (1969) AIIE Trans. , vol.1 , pp. 316-322
    • Pegels, C.C.1
  • 27
    • 74849101820 scopus 로고
    • Optimization and approximation in deterministic sequencing and scheduling: a survey
    • Graham R.L., Lawler E.L., Lenstra J.K., and Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5 (1979) 287-326
    • (1979) 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
  • 28
    • 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. Manage. Sci. 24 (1978) 530-534
    • (1978) Manage. Sci. , vol.24 , pp. 530-534
    • Townsend, W.1


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