메뉴 건너뛰기




Volumn 184, Issue 1, 2012, Pages 282-297

Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect

Author keywords

Flowshop; Learning effect; Scheduling; Worst case analysis

Indexed keywords

COMPLETION TIME; COMPUTATIONAL RESULTS; FLOW SHOP SCHEDULING PROBLEM; FLOW-SHOPS; LEARNING EFFECTS; MAKESPAN; MAXIMUM LATENESS; OBJECTIVE FUNCTIONS; POLYNOMIAL ALGORITHM; PROCESSING TIME; TIME-DEPENDENT LEARNING; TOTAL FLOWTIME; WEIGHTED COMPLETION; WORST-CASE ANALYSIS;

EID: 80055048882     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2011.08.018     Document Type: Article
Times cited : (36)

References (49)
  • 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
    • 38149027740 scopus 로고    scopus 로고
    • A state-of-the-art review on scheduling with learning effects
    • D. Biskup 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
    • 79952624468 scopus 로고    scopus 로고
    • A two-agent single-machine scheduling with truncated sum-of-processing- times-based learning considerations
    • doi:10.1016/j.cie.2010.12.008
    • T.C.E. Cheng, S.R. Cheng, W.H. Wu, P.H. Hsu, C.C. Wu, A two-agent single-machine scheduling with truncated sum-of-processing-times-based learning considerations, Computers & Industrial Engineering. doi:10.1016/j.cie.2010. 12.008.
    • Computers & Industrial Engineering
    • Cheng, T.C.E.1    Cheng, S.R.2    Wu, W.H.3    Hsu, P.H.4    Wu, C.C.5
  • 5
    • 67649743441 scopus 로고    scopus 로고
    • Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations
    • T.C.E. Cheng, P.J. Lai, C.C. Wu, and W.C. Lee Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations Information Sciences 179 2009 3127 3135
    • (2009) Information Sciences , vol.179 , pp. 3127-3135
    • Cheng, T.C.E.1    Lai, P.J.2    Wu, C.C.3    Lee, W.C.4
  • 6
    • 0034563358 scopus 로고    scopus 로고
    • Single machine scheduling with learning effect considerations
    • DOI 10.1023/A:1019216726076
    • T.C.E. Cheng, and G. Wang Single machine scheduling with learning effect considerations Annals of Operations Research 98 2000 273 290 (Pubitemid 33282737)
    • (2000) Annals of Operations Research , vol.98 , Issue.1-4 , pp. 273-290
    • Cheng, T.C.E.1    Wang, G.2
  • 7
    • 40849111346 scopus 로고    scopus 로고
    • Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
    • T.C.E. Cheng, C.C. Wu, and W.C. Lee Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects Information Sciences 178 2008 2476 2487
    • (2008) Information Sciences , vol.178 , pp. 2476-2487
    • Cheng, T.C.E.1    Wu, C.C.2    Lee, W.C.3
  • 8
    • 0017918132 scopus 로고
    • Flowshop and jobshop schedules: Complexity and approximation
    • T. Gonzalez, and S. Sahni Flowshop and jobshop schedules: complexity and approximation Operations Research 26 1978 36 52 (Pubitemid 8576420)
    • (1978) Operations Research , vol.26 , Issue.1 , pp. 36-52
    • Gonzalez, T.1    Sahni, S.2
  • 12
    • 51349127625 scopus 로고    scopus 로고
    • Viewpoint on: Complexity results for single-machine scheduling with positional learning effects
    • A. Janiak, and R. Rudek Viewpoint on: complexity results for 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
  • 13
    • 67349111349 scopus 로고    scopus 로고
    • Solution algorithms for the makespan minimization problem with the general learning model
    • A. Janiak, W. Janiak, R. Rudek, and A. Wielgus Solution algorithms for the makespan minimization problem with the general learning model Computers & Industrial Engineering 56 2009 1301 1308
    • (2009) Computers & Industrial Engineering , vol.56 , pp. 1301-1308
    • Janiak, A.1    Janiak, W.2    Rudek, R.3    Wielgus, A.4
  • 15
    • 34250317429 scopus 로고    scopus 로고
    • The learning effect: Getting to the core of the problem
    • DOI 10.1016/j.ipl.2007.03.013, PII S0020019007000889
    • A. Janiak, and R. Rudek The learning effect: getting to the core of the problem Information Processing Letters 103 2007 183 187 (Pubitemid 46924770)
    • (2007) Information Processing Letters , vol.103 , Issue.5 , pp. 183-187
    • Janiak, A.1    Rudek, R.2
  • 16
    • 41149091819 scopus 로고    scopus 로고
    • A new approach to the learning effect: Beyond the learning curve restrictions
    • DOI 10.1016/j.cor.2007.04.007, PII S0305054807000986
    • A. Janiak, and R. Rudek A new approach to the learning effect: beyond the learning curve restrictions Computers & Operations Research 35 2008 3727 3736 (Pubitemid 351443072)
    • (2008) Computers and Operations Research , vol.35 , Issue.11 , pp. 3727-3736
    • Janiak, A.1    Rudek, R.2
  • 18
    • 70649100029 scopus 로고    scopus 로고
    • A note on a makespan minimization problem with a multi-abilities learning effect
    • A. Janiak, and R. Rudek A note on a makespan minimization problem with a multi-abilities learning effect Omega 38 2009 213 217
    • (2009) Omega , vol.38 , pp. 213-217
    • Janiak, A.1    Rudek, R.2
  • 19
    • 0003075019 scopus 로고
    • Optimal two- and three-stage production schedules with setup times included
    • S.M. Johnson Optimal two- and three-stage production schedules with setup times included Naval Research Logistics Quarterly 1 1954 61 68
    • (1954) Naval Research Logistics Quarterly , vol.1 , pp. 61-68
    • Johnson, S.M.1
  • 20
    • 28144447572 scopus 로고    scopus 로고
    • Algorithms with performance guarantees for flow shops with regular objective functions
    • DOI 10.1080/07408170500288067, PII HU424H6QN7326123
    • C. Koulamas, and G. Kyparisis Algorithms with performance guarantees for flow shops with regular objective functions IIE Transactions 37 2005 1107 1111 (Pubitemid 41694330)
    • (2005) IIE Transactions (Institute of Industrial Engineers) , vol.37 , Issue.12 , pp. 1107-1111
    • Koulamas, C.1    Kyparisis, G.2
  • 21
    • 33746239045 scopus 로고    scopus 로고
    • Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
    • W.H. Kuo, and D.L. Yang 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
  • 22
    • 29144506060 scopus 로고    scopus 로고
    • Single-machine group scheduling with a time-dependent learning effect
    • W.H. Kuo, and D.L. Yang Single-machine group scheduling with a time-dependent learning effect Computers and Operations Research 33 2006 2099 2112
    • (2006) Computers and Operations Research , vol.33 , pp. 2099-2112
    • Kuo, W.H.1    Yang, D.L.2
  • 23
    • 34249292999 scopus 로고    scopus 로고
    • Single-machine scheduling problems with the time-dependent learning effect
    • W.H. Kuo, and D.L. Yang Single-machine scheduling problems with the time-dependent learning effect Computers and Mathematics with Applications 53 2007 1733 1739
    • (2007) Computers and Mathematics with Applications , vol.53 , pp. 1733-1739
    • Kuo, W.H.1    Yang, D.L.2
  • 24
    • 28244442171 scopus 로고    scopus 로고
    • Minimizing the makespan in a single machine scheduling problem with a time-based learning effect
    • W.H. Kuo, and D.L. Yang 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
  • 25
    • 77958492667 scopus 로고    scopus 로고
    • Note on Single-machine and flowshop scheduling with a general learning effect model and Some single-machine and m-machine flowshop scheduling problems with learning considerations
    • W.H. Kuo, and D.L. Yang Note on Single-machine and flowshop scheduling with a general learning effect model and Some single-machine and m-machine flowshop scheduling problems with learning considerations Information Sciences 180 2010 3814 3816
    • (2010) Information Sciences , vol.180 , pp. 3814-3816
    • Kuo, W.H.1    Yang, D.L.2
  • 26
    • 79251599951 scopus 로고    scopus 로고
    • Scheduling problems with general effects of deterioration and learning
    • W.C. Lee, and P.J. Lai Scheduling problems with general effects of deterioration and learning Information Sciences 181 2011 1164 1170
    • (2011) Information Sciences , vol.181 , pp. 1164-1170
    • Lee, W.C.1    Lai, P.J.2
  • 27
    • 69549116446 scopus 로고    scopus 로고
    • Some single-machine and m-machine flowshop scheduling problems with learning considerations
    • W.C. Lee, and C.C. Wu Some single-machine and m-machine flowshop scheduling problems with learning considerations Information Sciences 179 2009 3885 3892
    • (2009) Information Sciences , vol.179 , pp. 3885-3892
    • Lee, W.C.1    Wu, C.C.2
  • 28
    • 69549130676 scopus 로고    scopus 로고
    • A single-machine learning effect scheduling problem with release times
    • W.C. Lee, C.C. Wu, and P.H. Hsu A single-machine learning effect scheduling problem with release times Omega 38 2010 3 11
    • (2010) Omega , vol.38 , pp. 3-11
    • Lee, W.C.1    Wu, C.C.2    Hsu, P.H.3
  • 29
    • 21144435406 scopus 로고    scopus 로고
    • A bi-criterion single-machine scheduling problem with learning considerations
    • W.C. Lee, C.C. Wu, and H.J. Sung 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
  • 30
    • 34547242463 scopus 로고    scopus 로고
    • Complexity results for single-machine scheduling with positional learning effects
    • DOI 10.1057/palgrave.jors.2602227, PII 2602227
    • B.M.T. Lin Complexity results for single-machine scheduling with positional learning effects Journal of the Operational Research Society 58 2007 1099 1102 (Pubitemid 47150129)
    • (2007) Journal of the Operational Research Society , vol.58 , Issue.8 , pp. 1099-1102
    • Lin, B.M.T.1
  • 32
    • 0035493960 scopus 로고    scopus 로고
    • Parallel machine scheduling with a learning effect
    • G. Mosheiov Parallel machine scheduling with a learning effect Journal of the Operational Research Society 52 2001 1165 1169 (Pubitemid 34191547)
    • (2001) Journal of the Operational Research Society , vol.52 , Issue.10 , pp. 1165-1169
    • Mosheiov, G.1
  • 34
    • 12144249183 scopus 로고    scopus 로고
    • Note on scheduling with general learning curves to minimize the number of tardy jobs
    • DOI 10.1057/palgrave.jors.2601809
    • G. Mosheiov, and J.B. Sidney Note on scheduling with general learning curves to minimize the number of tardy jobs Journal of the Operational Research Society 56 2005 110 112 (Pubitemid 40108435)
    • (2005) Journal of the Operational Research Society , vol.56 , Issue.1 , pp. 110-112
    • Mosheiov, G.1    Sidney, J.B.2
  • 38
    • 0002066821 scopus 로고
    • Various optimizers for single-stage production
    • W.E. Smith Various optimizers for single-stage production Naval Research Logistics 3 1956 59 66
    • (1956) Naval Research Logistics , vol.3 , pp. 59-66
    • Smith, W.E.1
  • 39
    • 0002906088 scopus 로고    scopus 로고
    • Some results of the worst-case analysis for flow shop scheduling
    • PII S0377221797001392
    • C. Smutnicki Some results of the worst-case analysis for flow shop scheduling European Journal of Operational Research 109 1998 66 87 (Pubitemid 128393229)
    • (1998) European Journal of Operational Research , vol.109 , Issue.1 , pp. 66-87
    • Smutnicki, C.1
  • 40
    • 0017921371 scopus 로고
    • The single machine problem with quadratic penalty function of completion times: A branch-and-bound solution
    • W. Townsend The single machine problem with quadratic penalty function of completion times: a branch-and-bound solution Management Science 24 1978 530 534 (Pubitemid 8576487)
    • (1978) Management Science , vol.24 , Issue.5 , pp. 530-534
    • Townsend, W.1
  • 41
    • 37349025024 scopus 로고    scopus 로고
    • Single-machine scheduling with a time-dependent learning effect
    • DOI 10.1016/j.ijpe.2007.03.013, PII S0925527307001661
    • J.B. Wang, C.T. Ng, T.C.E. Cheng, and L.L. Liu Single-machine scheduling with a time-dependent learning effect International Journal of Production Economics 1 2008 802 811 (Pubitemid 350299170)
    • (2008) International Journal of Production Economics , vol.111 , Issue.2 , pp. 802-811
    • Wang, J.-B.1    Ng, C.T.2    Cheng, T.C.E.3    Liu, L.L.4
  • 42
    • 19944418255 scopus 로고    scopus 로고
    • Flow shop scheduling jobs with position-dependent processing times
    • J.B. Wang 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
  • 44
    • 79958780796 scopus 로고    scopus 로고
    • Branch-and-bound and simulated annealing alforithms for a total weighted completion time scheduling with ready times and learning effect
    • doi:10.1007/s00170-010-3022-7
    • C.C. Wu, P.H. Hsu, J.C. Chen, N.S. Wang, W.H. Wu, Branch-and-bound and simulated annealing alforithms for a total weighted completion time scheduling with ready times and learning effect, International Journal of Advanced Manufacturing Technology. doi:10.1007/s00170-010-3022-7.
    • International Journal of Advanced Manufacturing Technology
    • Wu, C.C.1    Hsu, P.H.2    Chen, J.C.3    Wang, N.S.4    Wu, W.H.5
  • 45
    • 77955466453 scopus 로고    scopus 로고
    • Minimizing the makespan on a single machine with learning and unequal release times
    • C.C. Wu, and C.L. Liu Minimizing the makespan on a single machine with learning and unequal release times Computers & Industrial Engineering 59 2010 419 424
    • (2010) Computers & Industrial Engineering , vol.59 , pp. 419-424
    • Wu, C.C.1    Liu, C.L.2
  • 46
    • 43549109426 scopus 로고    scopus 로고
    • Worst-case analysis for flow shop scheduling with a learning effect
    • Z. Xu, L. Sun, and J. Gong Worst-case analysis for flow shop scheduling with a learning effect International Journal of Production Economics 113 2008 748 753
    • (2008) International Journal of Production Economics , vol.113 , pp. 748-753
    • Xu, Z.1    Sun, L.2    Gong, J.3
  • 47
    • 0029184695 scopus 로고
    • A two-machine flowshop sequencing problem with limited waiting time constraints
    • D.L. Yang, and M.S. Chern A two-machine flowshop sequencing problem with limited waiting time constraints Computers & Industrial Engineering 28 1995 63 70
    • (1995) Computers & Industrial Engineering , vol.28 , pp. 63-70
    • Yang, D.L.1    Chern, M.S.2
  • 48
    • 67349130285 scopus 로고    scopus 로고
    • Some scheduling problems with general position-dependent and time-dependent learning effects
    • Y. Yin, D. Xu, K. Sun, and H. Li Some scheduling problems with general position-dependent and time-dependent learning effects Information Sciences 179 2009 2416 2425
    • (2009) Information Sciences , vol.179 , pp. 2416-2425
    • Yin, Y.1    Xu, D.2    Sun, K.3    Li, H.4
  • 49
    • 79953276887 scopus 로고    scopus 로고
    • Notes on some single-machine scheduling problems with general position-dependent and time-dependent learning effects
    • Y. Yin, D. Xu, and X. Huang Notes on some single-machine scheduling problems with general position-dependent and time-dependent learning effects Information Sciences 181 2011 2209 2217
    • (2011) Information Sciences , vol.181 , pp. 2209-2217
    • Yin, Y.1    Xu, D.2    Huang, X.3


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