메뉴 건너뛰기




Volumn 111, Issue 4, 2011, Pages 174-177

Proportionate flowshops with general position-dependent processing times

Author keywords

Makespan; Position dependent processing times; Proportionate flowshop; Scheduling

Indexed keywords

FLOW-SHOPS; JOB PROCESSING TIME; MAKESPAN; MINIMUM MAKESPAN; POLYNOMIAL-TIME; POSITION-DEPENDENT PROCESSING TIMES; PROCESSING TIME;

EID: 78649496041     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2010.11.016     Document Type: Article
Times cited : (24)

References (20)
  • 2
    • 0345201636 scopus 로고    scopus 로고
    • Single-machine scheduling with learning considerations
    • D. Biskup 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
  • 3
    • 33747152563 scopus 로고    scopus 로고
    • A bi-criteria two-machine flowshop scheduling problem with a learning effect
    • P. Chen, C.-C. Wu, and W.-C. Lee A bi-criteria two-machine flowshop scheduling problem with a learning effect Journal of the Operational Research Society 57 2006 1113 1125
    • (2006) Journal of the Operational Research Society , vol.57 , pp. 1113-1125
    • Chen, P.1    Wu, C.-C.2    Lee, W.-C.3
  • 4
    • 0034563358 scopus 로고    scopus 로고
    • Single machine scheduling with learning effect considerations
    • T.C.E. Cheng, and G. Wang 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
  • 5
    • 0000135213 scopus 로고
    • Algorithms for two bottleneck optimization problems
    • H.N. Gabow, and R.E. Tarjan Algorithms for two bottleneck optimization problems Journal of Algorithms 11 1988 411 417
    • (1988) Journal of Algorithms , vol.11 , pp. 411-417
    • Gabow, H.N.1    Tarjan, R.E.2
  • 6
    • 67349111349 scopus 로고    scopus 로고
    • Solution algorithms for the makespan minimization problem with a general learning model
    • A. Janiak, W. Janiak, R. Rudek, and A. Wielgus Solution algorithms for the makespan minimization problem with a general learning model Computers and Industrial Engineering 56 2009 1301 1308
    • (2009) Computers and Industrial Engineering , vol.56 , pp. 1301-1308
    • Janiak, A.1    Janiak, W.2    Rudek, R.3    Wielgus, A.4
  • 7
    • 33645698319 scopus 로고    scopus 로고
    • Job sequencing with exponential functions of processing times
    • A. Janiak, and M.Y. Kovalyov Job sequencing with exponential functions of processing times Informatica 17 2006 13 24
    • (2006) Informatica , vol.17 , pp. 13-24
    • Janiak, A.1    Kovalyov, M.Y.2
  • 8
  • 9
    • 51349127625 scopus 로고    scopus 로고
    • Viewpoint: Complexity resultsfor single-machine scheduling with positional learning effects
    • A. Janiak, and R. Rudek Viewpoint: complexity resultsfor single-machine scheduling with positional learning effects Journal of the Operational Research Society 59 2008 1430
    • (2008) Journal of the Operational Research Society , vol.59 , pp. 1430
    • Janiak, A.1    Rudek, R.2
  • 10
    • 34250317429 scopus 로고    scopus 로고
    • The learning effect: Getting to the core of the problem
    • A. Janiak, and R. Rudek The learning effect: getting to the core of the problem Information Processing Letters 103 2007 183 187
    • (2007) Information Processing Letters , vol.103 , pp. 183-187
    • Janiak, A.1    Rudek, R.2
  • 11
    • 33750993497 scopus 로고    scopus 로고
    • Single-machine and two-machine flowshop scheduling with general learning functions
    • C. Koulamas, and G.J. Kyparisis 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
    • Koulamas, C.1    Kyparisis, G.J.2
  • 12
    • 0742284281 scopus 로고    scopus 로고
    • Minimizing total completion time in a two-machine flowshop with a learning effect
    • W.-C. Lee, and C.-C. Wu 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
  • 13
    • 34547242463 scopus 로고    scopus 로고
    • Complexity results for the single machine scheduling with positional learning effects
    • B.M.T. Lin Complexity results for the single machine scheduling with positional learning effects Journal of the Operational Research Society 58 2007 1099 1102
    • (2007) Journal of the Operational Research Society , vol.58 , pp. 1099-1102
    • Lin, B.M.T.1
  • 16
    • 0022093883 scopus 로고
    • Focused scheduling in proportionate flowshops
    • P.S. Ow Focused scheduling in proportionate flowshops Management Science 31 1985 852 869
    • (1985) Management Science , vol.31 , pp. 852-869
    • Ow, P.S.1
  • 19
    • 33749005938 scopus 로고    scopus 로고
    • A note on scheduling problems with learning effects and deteriorating jobs
    • J.-B. Wang A note on scheduling problems with learning effects and deteriorating jobs International Journal of Systems Sciences 37 2006 827 833
    • (2006) International Journal of Systems Sciences , vol.37 , pp. 827-833
    • Wang, J.-B.1


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