메뉴 건너뛰기




Volumn 45, Issue 2, 2007, Pages 75-81

A bicriteria scheduling problem with a learning effect: Total completion time and total tardiness

Author keywords

Bicriteria scheduling; Heuristic method; Learning effect; Mathematical programming; Single machine scheduling; Tabu search

Indexed keywords

HEURISTIC METHODS; HEURISTIC PROGRAMMING; MATHEMATICAL PROGRAMMING; SCHEDULING; SCHEDULING ALGORITHMS; TABU SEARCH;

EID: 45749118684     PISSN: 03155986     EISSN: None     Source Type: Journal    
DOI: 10.3138/infor.45.2.75     Document Type: Article
Times cited : (25)

References (23)
  • 1
    • 0345201636 scopus 로고    scopus 로고
    • Single machine scheduling with learning considerations
    • Biskup, D. (1999) Single machine scheduling with learning considerations. European Journal of Operational Research, 115: 173-178.
    • (1999) European Journal of Operational Research , vol.115 , pp. 173-178
    • Biskup, D.1
  • 2
    • 3343007213 scopus 로고    scopus 로고
    • Common due date scheduling with autonomous and induced learning
    • Biskup, D. and Simons, D. (2004) Common due date scheduling with autonomous and induced learning. European Journal of Operational Research, 159: 606-616.
    • (2004) European Journal of Operational Research , vol.159 , pp. 606-616
    • Biskup, D.1    Simons, D.2
  • 3
    • 0034563358 scopus 로고    scopus 로고
    • Single machine scheduling with learning effect considerations
    • Cheng, T.C.E. and Wang, G. (2000) Single machine scheduling with learning effect considerations. Annals of Operations Research, 98: 273-290.
    • (2000) Annals of Operations Research , vol.98 , pp. 273-290
    • Cheng, T.C.E.1    Wang, G.2
  • 4
    • 0000474126 scopus 로고
    • Minimizing total tardiness on one machine is NP-hard
    • Du, J. and Leung, J.Y.T. (1990) Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research, 15: 483-495.
    • (1990) Mathematics of Operations Research , vol.15 , pp. 483-495
    • Du, J.1    Leung, J.Y.T.2
  • 5
    • 33846579161 scopus 로고    scopus 로고
    • Minimizing total tardiness in a scheduling problem with a learning effect
    • Eren, T. and Giiner, E. (2007) Minimizing total tardiness in a scheduling problem with a learning effect. Applied Mathematical Modelling, 31 (7): 1351-1361.
    • (2007) Applied Mathematical Modelling , vol.31 , Issue.7 , pp. 1351-1361
    • Eren, T.1    Giiner, E.2
  • 7
    • 0022865373 scopus 로고
    • Future paths for integer programming and links to artificial intelligence
    • Glover, F. (1986) Future paths for integer programming and links to artificial intelligence. Computers and Operations Research, 5: 533-549.
    • (1986) Computers and Operations Research , vol.5 , pp. 533-549
    • Glover, F.1
  • 8
    • 0142246404 scopus 로고    scopus 로고
    • Minimizing of maximum lateness under linear deterioration
    • Hsu, Y.S. and Lin, B.N.T. (2003) Minimizing of maximum lateness under linear deterioration. Omega, 31: 459-469.
    • (2003) Omega , vol.31 , pp. 459-469
    • Hsu, Y.S.1    Lin, B.N.T.2
  • 9
    • 45749128316 scopus 로고    scopus 로고
    • http://kartal.kku.edu.tr/∼teren/
  • 10
    • 29144506060 scopus 로고    scopus 로고
    • Single-machine group scheduling with a time-dependent learning effect
    • Kuo, W.-H. and Yang, D.-L. (2006) Single-machine group scheduling with a time-dependent learning effect. Computers & Operations Research, 33: 2099-2112.
    • (2006) Computers & Operations Research , vol.33 , pp. 2099-2112
    • Kuo, W.-H.1    Yang, D.-L.2
  • 11
    • 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. (2006) Minimizing the makespan in a single machine scheduling problem with a time-based learning effect. Information Processing Letters, 97: 64-67.
    • (2006) Information Processing Letters , vol.97 , pp. 64-67
    • Kuo, W.-H.1    Yang, D.-L.2
  • 12
    • 33746239045 scopus 로고    scopus 로고
    • Minimizing the total completion time in a single-machine scheduling problem with a timedependent learning effect
    • Kuo, W.-H. and Yang, D.-L. (2006) Minimizing the total completion time in a single-machine scheduling problem with a timedependent learning effect. European Journal of Operational Research, 174(2): 1184-1190.
    • (2006) European Journal of Operational Research , vol.174 , Issue.2 , pp. 1184-1190
    • Kuo, W.-H.1    Yang, D.-L.2
  • 13
    • 33744731083 scopus 로고    scopus 로고
    • A note on deteriorating jobs and learning in single-machine scheduling problems
    • Lee, W.-C. (2004) A note on deteriorating jobs and learning in single-machine scheduling problems. International Journal of Business and Economics, 3: 83-89.
    • (2004) International Journal of Business and Economics , vol.3 , pp. 83-89
    • Lee, W.-C.1
  • 14
    • 21144435406 scopus 로고    scopus 로고
    • A bi-criterion single-machine scheduling problem with learning considerations
    • Lee, W.-C, Wu, C.-C. and Sung, H.-J. (2004) A bi-criterion single-machine scheduling problem with learning considerations. Acta Informatica, 40: 303-315.
    • (2004) Acta Informatica , vol.40 , pp. 303-315
    • Lee, W.-C.1    Wu, C.-C.2    Sung, H.-J.3
  • 17
    • 12144249183 scopus 로고    scopus 로고
    • Note on scheduling with general learning curves to minimize the number of tardy jobs
    • Mosheiov, G. and Sidney, J.B. (2005) Note on scheduling with general learning curves to minimize the number of tardy jobs. Journal of the Operational Research Society, 56: 110-112.
    • (2005) Journal of the Operational Research Society , vol.56 , pp. 110-112
    • Mosheiov, G.1    Sidney, J.B.2
  • 18
    • 0020699921 scopus 로고
    • A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem
    • Nawaz, M., Enscore, E.E. and Ham, I. (1983) A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega, 11: 91-95.
    • (1983) Omega , vol.11 , pp. 91-95
    • Nawaz, M.1    Enscore, E.E.2    Ham, I.3
  • 20
    • 0034588680 scopus 로고    scopus 로고
    • Heuristic for scheduling in a two-machine bicriteria dynamic flowshop with setup and processing times separated
    • Su, L.H. and Chou, F.-D. (2000) Heuristic for scheduling in a two-machine bicriteria dynamic flowshop with setup and processing times separated. Production Planning & Control, 11 (8): 806-819.
    • (2000) Production Planning & Control , vol.11 , Issue.8 , pp. 806-819
    • Su, L.H.1    Chou, F.-D.2
  • 21
    • 33748913175 scopus 로고    scopus 로고
    • Single-machine scheduling problems with the effects of learning and deterioration
    • Wang, J.B. (2006) Single-machine scheduling problems with the effects of learning and deterioration. Omega, 35 (4): 397-402.
    • (2006) Omega , vol.35 , Issue.4 , pp. 397-402
    • Wang, J.B.1
  • 22
    • 33750843991 scopus 로고    scopus 로고
    • Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan
    • Wang, X. and Cheng, T.C.E. (2007) Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan. European Journal of Operational Research, 178 (1): 57-70.
    • (2007) European Journal of Operational Research , vol.178 , Issue.1 , pp. 57-70
    • Wang, X.1    Cheng, T.C.E.2


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