메뉴 건너뛰기




Volumn 56, Issue 8, 2008, Pages 1941-1947

Single-machine scheduling with general learning functions

Author keywords

Learning effect; Maximum lateness; Number of tardy jobs; Scheduling; Single machine; Sum of completion times square; Weighted sum of completion times

Indexed keywords

SCHEDULING;

EID: 51049120069     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.camwa.2008.04.019     Document Type: Article
Times cited : (28)

References (24)
  • 1
    • 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
  • 2
    • 0001250106 scopus 로고
    • Factors affecting the cost of airplanes
    • Wright T.P. Factors affecting the cost of airplanes. Journal of Aeronautical Sciences 3 (1936) 122-128
    • (1936) Journal of Aeronautical Sciences , vol.3 , pp. 122-128
    • Wright, T.P.1
  • 3
    • 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. European Journal of Operational Research 188 (2008) 315-329
    • (2008) European Journal of Operational Research , vol.188 , pp. 315-329
    • Biskup, D.1
  • 4
    • 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
  • 5
    • 0034563358 scopus 로고    scopus 로고
    • Single machine scheduling with learning effect considerations
    • Cheng T.C.E., and Wang G. Single machine scheduling with learning effect considerations. Annals of Operations Research 98 (2000) 273-290
    • (2000) Annals of Operations Research , vol.98 , pp. 273-290
    • Cheng, T.C.E.1    Wang, G.2
  • 9
    • 0742284281 scopus 로고    scopus 로고
    • Minimizing total completion time in a two-machine flowshop with a learning effect
    • Lee W.-C., and Wu C.-C. Minimizing total completion time in a two-machine flowshop with a learning effect. International Journal of Production Economics 88 (2004) 85-93
    • (2004) International Journal of Production Economics , vol.88 , pp. 85-93
    • Lee, W.-C.1    Wu, C.-C.2
  • 10
    • 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
  • 11
    • 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
  • 12
    • 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
  • 13
    • 19944418255 scopus 로고    scopus 로고
    • Flow shop scheduling jobs with position-dependent processing times
    • Wang J.-B. Flow shop scheduling jobs with position-dependent processing times. Journal of Applied Mathematics and Computing 18 (2005) 383-391
    • (2005) Journal of Applied Mathematics and Computing , vol.18 , pp. 383-391
    • Wang, J.-B.1
  • 15
    • 28244442171 scopus 로고    scopus 로고
    • Minimizing the makespan in a single machine scheduling problem with a time-based learning effect
    • Kuo W.-H., and Yang D.-L. Minimizing the makespan in a single machine scheduling problem with a time-based learning effect. Information Processing Letters 97 (2006) 64-67
    • (2006) Information Processing Letters , vol.97 , pp. 64-67
    • Kuo, W.-H.1    Yang, D.-L.2
  • 16
    • 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
  • 17
    • 29144506060 scopus 로고    scopus 로고
    • Single-machine group scheduling with a time-dependent learning effect
    • Kuo W.-H., and Yang D.-L. Single-machine group scheduling with a time-dependent learning effect. Computers & Operations Research 33 (2006) 2099-2112
    • (2006) Computers & Operations Research , vol.33 , pp. 2099-2112
    • Kuo, W.-H.1    Yang, D.-L.2
  • 18
    • 33750993497 scopus 로고    scopus 로고
    • Single-machine and two-machine flowshop scheduling with general learning functions
    • Kuolamas C., and Kyparisis G.J. Single-machine and two-machine flowshop scheduling with general learning functions. European Journal of Operational Research 178 (2007) 402-407
    • (2007) European Journal of Operational Research , vol.178 , pp. 402-407
    • Kuolamas, C.1    Kyparisis, G.J.2
  • 21
    • 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
  • 22
    • 0000062028 scopus 로고
    • An n job, one machine sequencing algorithm for minimizing the number of late jobs
    • Moore J. An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science 15 (1968) 102-109
    • (1968) Management Science , vol.15 , pp. 102-109
    • Moore, J.1
  • 23
    • 85081446382 scopus 로고    scopus 로고
    • J.R. Jackson, Scheduling a production line to minimize maximum tardiness, Research Report 43, Management Sciences Research Project, UCLA, January, 1955
    • J.R. Jackson, Scheduling a production line to minimize maximum tardiness, Research Report 43, Management Sciences Research Project, UCLA, January, 1955


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