메뉴 건너뛰기




Volumn 40, Issue 11-12, 2009, Pages 1202-1205

A bicriteria parallel machine scheduling with a learning effect

Author keywords

Bicriteria; Learning effect; Mathematical programming model; Parallel machine scheduling; Total completion time; Total tardiness

Indexed keywords

BUSINESS MACHINES; EDUCATION; MATHEMATICAL PROGRAMMING; SCHEDULING;

EID: 60749100763     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-008-1436-2     Document Type: Article
Times cited : (33)

References (16)
  • 1
    • 0345201636 scopus 로고    scopus 로고
    • Single-machine scheduling with learning considerations
    • D Biskup 1999 Single-machine scheduling with learning considerations Eur J Oper Res 115 173 178
    • (1999) Eur J Oper Res , vol.115 , pp. 173-178
    • Biskup, D.1
  • 2
    • 0035427775 scopus 로고    scopus 로고
    • Scheduling problems with a learning effect
    • G Mosheiov 2001 Scheduling problems with a learning effect Eur J Oper Res 132 687 693
    • (2001) Eur J Oper Res , vol.132 , pp. 687-693
    • Mosheiov, G.1
  • 3
    • 0035493960 scopus 로고    scopus 로고
    • Parallel machine scheduling with a learning effect
    • G Mosheiov 2001 Parallel machine scheduling with a learning effect J Oper Res Soc 52 1165 1169
    • (2001) J Oper Res Soc , vol.52 , pp. 1165-1169
    • Mosheiov, G.1
  • 4
    • 21144435406 scopus 로고    scopus 로고
    • A bi-criterion single machine scheduling problem with learning considerations
    • WC Lee CC Wu HJ Sung 2004 A bi-criterion single machine scheduling problem with learning considerations Acta Inform 40 303 315
    • (2004) Acta Inform , vol.40 , pp. 303-315
    • Lee, W.C.1    Wu, C.C.2    Sung, H.J.3
  • 5
    • 0742284281 scopus 로고    scopus 로고
    • Minimizing total completion time in a two-machine flowshop with a learning effect
    • WC Lee CC Wu 2004 Minimizing total completion time in a two-machine flowshop with a learning effect Int J Prod Econ 88 85 93
    • (2004) Int J Prod Econ , vol.88 , pp. 85-93
    • Lee, W.C.1    Wu, C.C.2
  • 6
    • 0037449223 scopus 로고    scopus 로고
    • Scheduling with general job-dependent learning curves
    • G Mosheiov J Sidney 2003 Scheduling with general job-dependent learning curves Eur J Oper Res 147 665 670
    • (2003) Eur J Oper Res , vol.147 , pp. 665-670
    • Mosheiov, G.1    Sidney, J.2
  • 7
    • 33846579161 scopus 로고    scopus 로고
    • Minimizing total tardiness in a scheduling problem with a learning effect
    • 7
    • T Eren E Güner 2007 Minimizing total tardiness in a scheduling problem with a learning effect Appl Math Model 31 7 1351 1361
    • (2007) Appl Math Model , vol.31 , pp. 1351-1361
    • Eren, T.1    Güner, E.2
  • 8
    • 33845761375 scopus 로고    scopus 로고
    • A two-machine flowshop maximum tardiness scheduling problem with a learning effect
    • CC Wu WC Lee WC Wang 2007 A two-machine flowshop maximum tardiness scheduling problem with a learning effect Int J Adv Manuf Technol 31 743 750
    • (2007) Int J Adv Manuf Technol , vol.31 , pp. 743-750
    • Wu, C.C.1    Lee, W.C.2    Wang, W.C.3
  • 9
    • 85047682812 scopus 로고    scopus 로고
    • A bicriteria scheduling with a learning effect: Total completion time and total tardiness
    • in print
    • Eren T, Güner E (in print) A bicriteria scheduling with a learning effect: total completion time and total tardiness. Infor
    • Infor
    • Eren, T.1    Güner, E.2
  • 10
    • 0742284281 scopus 로고    scopus 로고
    • Minimizing total completion time in a two-machine flowshop with a learning effect
    • WC Lee CC Wu 2004 Minimizing total completion time in a two-machine flowshop with a learning effect Int J Prod Econ 88 85 93
    • (2004) Int J Prod Econ , vol.88 , pp. 85-93
    • Lee, W.C.1    Wu, C.C.2
  • 12
    • 43949118118 scopus 로고    scopus 로고
    • A bicriteria flowshop scheduling with a learning effect
    • in print
    • Eren T, Güner E (in print) A bicriteria flowshop scheduling with a learning effect. Appl Math Model
    • Appl Math Model
    • Eren, T.1    Güner, E.2
  • 13
    • 0000474126 scopus 로고
    • Minimizing total tardiness on one machine is NP-hard
    • J Du JYT Leung 1990 Minimizing total tardiness on one machine is NP-hard Math Oper Res 15 483 495
    • (1990) Math Oper Res , vol.15 , pp. 483-495
    • Du, J.1    Leung, J.Y.T.2
  • 14
    • 0142246404 scopus 로고    scopus 로고
    • Minimizing of maximum lateness under linear deterioration
    • YS Hsu BNT Lin 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
  • 15
    • 60749133078 scopus 로고    scopus 로고
    • http://kku.edu.tr/teren/


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