메뉴 건너뛰기




Volumn 191, Issue 1, 2011, Pages 155-169

Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects

Author keywords

Flow shop; Learning effect; Scheduling; Worst case analysis

Indexed keywords


EID: 81855194264     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-011-0923-2     Document Type: Article
Times cited : (53)

References (47)
  • 2
    • 0026868478 scopus 로고
    • Computational survey of univariate and multivariate learning curve models
    • Badiru, A. B. (1992). Computational survey of univariate and multivariate learning curve models. IEEE transactions on Engineering Management, 39, 176-188.
    • (1992) IEEE Transactions on Engineering Management , vol.39 , pp. 176-188
    • Badiru, A.B.1
  • 3
    • 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
  • 4
    • 38149027740 scopus 로고    scopus 로고
    • A state-of-the-art review on scheduling with learning effects
    • Biskup, D. (2008). A state-of-the-art review on scheduling with learning effects. European Journal of Operational Research, 188, 315-329.
    • (2008) European Journal of Operational Research , vol.188 , pp. 315-329
    • Biskup, D.1
  • 5
    • 0034563358 scopus 로고    scopus 로고
    • Single machine scheduling with learning effect considerations
    • Cheng, T. C. E., & 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
  • 6
    • 40849111346 scopus 로고    scopus 로고
    • Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
    • Cheng, T. C. E., Wu, C. C., & Lee, W. C. (2008a). Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects. Information Sciences, 178(11), 2476-2487.
    • (2008) Information Sciences , vol.178 , Issue.11 , pp. 2476-2487
    • Cheng, T.C.E.1    Wu, C.C.2    Lee, W.C.3
  • 7
    • 41449089275 scopus 로고    scopus 로고
    • Some scheduling problems with deteriorating jobs and learning effects
    • Cheng, T. C. E., Wu, C. C., & Lee, W. C. (2008b). Some scheduling problems with deteriorating jobs and learning effects. Computers & Industrial Engineering, 54(4), 972-982.
    • (2008) Computers & Industrial Engineering , vol.54 , Issue.4 , pp. 972-982
    • Cheng, T.C.E.1    Wu, C.C.2    Lee, W.C.3
  • 8
    • 67649743441 scopus 로고    scopus 로고
    • Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations
    • Cheng, T. C. E., Lai, P.-J., Wu, C.-C., & Lee, W.-C. (2009). Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations. Information Sciences, 197, 3127-3135.
    • (2009) Information Sciences , vol.197 , pp. 3127-3135
    • Cheng, T.C.E.1    Lai, P.-J.2    Wu, C.-C.3    Lee, W.-C.4
  • 9
    • 54049131297 scopus 로고    scopus 로고
    • A bicriteria parallel machine scheduling with a learning effect of setup and removal times
    • Eren, T. (2009). A bicriteria parallel machine scheduling with a learning effect of setup and removal times. Applied Mathematical Modelling, 33, 1141-1150.
    • (2009) Applied Mathematical Modelling , vol.33 , pp. 1141-1150
    • Eren, T.1
  • 10
    • 45749118684 scopus 로고    scopus 로고
    • A bicriteria scheduling with a learning effect: total completion time and total tardiness. INFOR: Information Systems and
    • Eren, T., & Guner, E. (2007a). A bicriteria scheduling with a learning effect: total completion time and total tardiness. INFOR: Information Systems and. Operational Research, 45, 75-81.
    • (2007) Operational Research , vol.45 , pp. 75-81
    • Eren, T.1    Guner, E.2
  • 11
    • 33846579161 scopus 로고    scopus 로고
    • Minimizing total tardiness in a scheduling problem with a learning effect
    • Eren, T., & Guner, E. (2007b). Minimizing total tardiness in a scheduling problem with a learning effect. Applied Mathematical Modelling, 31, 1351-1361.
    • (2007) Applied Mathematical Modelling , vol.31 , pp. 1351-1361
    • Eren, T.1    Guner, E.2
  • 13
    • 0017918132 scopus 로고
    • Flowshop and jobshop schedules: Complexity and approximation
    • Gonzalez, T., & Sahni, S. (1978). Flowshop and jobshop schedules: Complexity and approximation. Operations Research, 26, 36-52.
    • (1978) Operations Research , vol.26 , pp. 36-52
    • Gonzalez, T.1    Sahni, S.2
  • 15
    • 0033311145 scopus 로고    scopus 로고
    • Minimizing total completion time in a two-machine flowshop: Analysis of special cases
    • Hoogeveen, J. A., & Kawaguchi, T. (1999). Minimizing total completion time in a two-machine flowshop: Analysis of special cases. Mathematics of Operations Research, 24, 887-910.
    • (1999) Mathematics of Operations Research , vol.24 , pp. 887-910
    • Hoogeveen, J.A.1    Kawaguchi, T.2
  • 16
    • 0032649356 scopus 로고    scopus 로고
    • The economic manufacture/order quantity (EMQ/EOQ) and the learning curve: past, present, and future
    • Jaber, Y. M., & Bonney, M. (1999). The economic manufacture/order quantity (EMQ/EOQ) and the learning curve: past, present, and future. International Journal of Production Economics, 59, 93-102.
    • (1999) International Journal of Production Economics , vol.59 , pp. 93-102
    • Jaber, Y.M.1    Bonney, M.2
  • 17
    • 41149091819 scopus 로고    scopus 로고
    • A new approach to the learning effect: beyond the learning curve restrictions
    • Janiak, A., & Rudek, R. (2008a). A new approach to the learning effect: beyond the learning curve restrictions. Computers and Operations Research, 35, 3727-3736.
    • (2008) Computers and Operations Research , vol.35 , pp. 3727-3736
    • Janiak, A.1    Rudek, R.2
  • 18
    • 62149094359 scopus 로고    scopus 로고
    • Experience based approach to scheduling problems with the learning effect
    • Janiak, A., & Rudek, R. (2008b). Experience based approach to scheduling problems with the learning effect. IEEE Transactions on Systems, Man, and Cybernetics-Part A, 39(2), 344-357.
    • (2008) IEEE Transactions on Systems, Man, and Cybernetics-Part A , vol.39 , Issue.2 , pp. 344-357
    • Janiak, A.1    Rudek, R.2
  • 19
    • 67349111349 scopus 로고    scopus 로고
    • Solution algorithms for the makespan minimization problem with the general learning model
    • Janiak, A., Janiak, W., Rudek, R., & Wielgus, A. (2009). Solution algorithms for the makespan minimization problem with the general learning model. Computers and Industrial Engineering, 56, 1301-1308.
    • (2009) Computers and Industrial Engineering , vol.56 , pp. 1301-1308
    • Janiak, A.1    Janiak, W.2    Rudek, R.3    Wielgus, A.4
  • 20
    • 0003075019 scopus 로고
    • Optimal two-and-three-stage production schedules
    • Johnson, S. M. (1954). Optimal two-and-three-stage production schedules. Naval Research Logistics, 1, 61-68.
    • (1954) Naval Research Logistics , vol.1 , pp. 61-68
    • Johnson, S.M.1
  • 21
    • 28144447572 scopus 로고    scopus 로고
    • Algorithms with performance guarantees for flow shops with regular objective functions
    • Koulamas, C., & Kyparisis, G. J. (2005). Algorithms with performance guarantees for flow shops with regular objective functions. IIE Transactions, 37, 1107-1111.
    • (2005) IIE Transactions , vol.37 , pp. 1107-1111
    • Koulamas, C.1    Kyparisis, G.J.2
  • 22
    • 33750993497 scopus 로고    scopus 로고
    • Single-machine and two-machine flowshop scheduling with general learning functions
    • Koulamas, C., & Kyparisis, G. J. (2007). Single-machine and two-machine flowshop scheduling with general learning functions. European Journal of Operational Research, 178, 402-407.
    • (2007) European Journal of Operational Research , vol.178 , pp. 402-407
    • Koulamas, C.1    Kyparisis, G.J.2
  • 23
    • 0742284281 scopus 로고    scopus 로고
    • Minimizing total completion time in a two-machine flowshop with a learning effect
    • Lee, W.-C., & Wu, C.-C. (2004). Minimizing total completion time in a two-machine flowshop with a learning effect. International Journal of Production Economics, 88, 85-93.
    • (2004) International Journal of Production Economics , vol.88 , pp. 85-93
    • Lee, W.-C.1    Wu, C.-C.2
  • 24
    • 69549116446 scopus 로고    scopus 로고
    • Some single-machine and m-machine flowshop scheduling problems with learning considerations
    • Lee, W.-C., & Wu, C.-C. (2009). Some single-machine and m-machine flowshop scheduling problems with learning considerations. Information Sciences, 179, 3885-3892.
    • (2009) Information Sciences , vol.179 , pp. 3885-3892
    • Lee, W.-C.1    Wu, C.-C.2
  • 25
    • 21144435406 scopus 로고    scopus 로고
    • A bi-criterion single-machine scheduling problem with learning considerations
    • Lee, W.-C., Wu, C.-C., & 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
  • 27
    • 0035493960 scopus 로고    scopus 로고
    • Parallel machine scheduling with a learning effect
    • Mosheiov, G. (2001b). Parallel machine scheduling with a learning effect. Journal of the Operational Research Society, 52, 1165-1169.
    • (2001) Journal of the Operational Research Society , vol.52 , pp. 1165-1169
    • Mosheiov, G.1
  • 28
    • 51349139418 scopus 로고    scopus 로고
    • Minimizing total absolute deviation of job completion times: Extensions to position-dependent processing times and parallel identical machines
    • Mosheiov, G. (2008). Minimizing total absolute deviation of job completion times: Extensions to position-dependent processing times and parallel identical machines. Journal of the Operational Research Society, 59, 1422-1424.
    • (2008) Journal of the Operational Research Society , vol.59 , pp. 1422-1424
    • Mosheiov, G.1
  • 29
    • 44849113738 scopus 로고    scopus 로고
    • A due-window assignment problem with position-dependent processing times
    • Mosheiov, G., & Sarig, A. (2008). A due-window assignment problem with position-dependent processing times. Journal of the Operational Research Society, 59, 997-1003.
    • (2008) Journal of the Operational Research Society , vol.59 , pp. 997-1003
    • Mosheiov, G.1    Sarig, A.2
  • 31
    • 12144249183 scopus 로고    scopus 로고
    • Note on scheduling with general learning curves to minimize the number of tardy jobs
    • Mosheiov, G., & 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
  • 33
    • 0001491109 scopus 로고
    • Scheduling independent tasks on parallel processors
    • Rothkopf, M. H. (1966). Scheduling independent tasks on parallel processors. Management Science, 12, 437-447.
    • (1966) Management Science , vol.12 , pp. 437-447
    • Rothkopf, M.H.1
  • 34
    • 0002066821 scopus 로고
    • Various optimizers for single-stage production
    • Smith, W. E. (1956). Various optimizers for single-stage production. Naval Research Logistics, 3, 59-66.
    • (1956) Naval Research Logistics , vol.3 , pp. 59-66
    • Smith, W.E.1
  • 35
    • 0002906088 scopus 로고    scopus 로고
    • Some results of worst-case analysis for flow shop scheduling
    • Smutnicki, C. (1998). Some results of worst-case analysis for flow shop scheduling. European Journal of Operational Research, 109, 66-87.
    • (1998) European Journal of Operational Research , vol.109 , pp. 66-87
    • Smutnicki, C.1
  • 36
    • 0017921371 scopus 로고
    • The single machine problem with quadratic penalty function of completion times: a branch-and-bound solution
    • Townsend, W. (1978). The single machine problem with quadratic penalty function of completion times: a branch-and-bound solution. Management Science, 24, 530-534.
    • (1978) Management Science , vol.24 , pp. 530-534
    • Townsend, W.1
  • 37
    • 19944418255 scopus 로고    scopus 로고
    • Flow shop scheduling jobs with position-dependent processing times
    • Wang, J.-B. (2005). Flow shop scheduling jobs with position-dependent processing times. Journal of Applied Mathematics and Computing, 18, 383-391.
    • (2005) Journal of Applied Mathematics and Computing , vol.18 , pp. 383-391
    • Wang, J.-B.1
  • 39
    • 79952630194 scopus 로고    scopus 로고
    • Single-machine scheduling jobs with exponential learning functions
    • Wang, J.-B., & Wang, J.-J. (2011a). Single-machine scheduling jobs with exponential learning functions. Computers & Industrial Engineering, 60, 755-759.
    • (2011) Computers & Industrial Engineering , vol.60 , pp. 755-759
    • Wang, J.-B.1    Wang, J.-J.2
  • 40
    • 77958492339 scopus 로고    scopus 로고
    • A revision of machine scheduling problems with a general learning effect
    • Wang, J.-B., & Wang, M.-Z. (2011b). A revision of machine scheduling problems with a general learning effect. Mathematical and Computer Modelling, 53, 330-336.
    • (2011) Mathematical and Computer Modelling , vol.53 , pp. 330-336
    • Wang, J.-B.1    Wang, M.-Z.2
  • 42
    • 77952887957 scopus 로고    scopus 로고
    • Single machine scheduling with exponential sum-of-logarithm-processing-times based learning effect
    • Wang, J.-B., Sun, L.-H., & Sun, L.-Y. (2010). Single machine scheduling with exponential sum-of-logarithm-processing-times based learning effect. Applied Mathematical Modelling, 34, 2813-2819.
    • (2010) Applied Mathematical Modelling , vol.34 , pp. 2813-2819
    • Wang, J.-B.1    Sun, L.-H.2    Sun, L.-Y.3
  • 44
    • 40649107395 scopus 로고    scopus 로고
    • Single-machine scheduling problems with a learning effect
    • Wu, C.-C., & Lee, W.-C. (2008). Single-machine scheduling problems with a learning effect. Applied Mathematical Modelling, 32(7), 1191-1197.
    • (2008) Applied Mathematical Modelling , vol.32 , Issue.7 , pp. 1191-1197
    • Wu, C.-C.1    Lee, W.-C.2
  • 45
    • 77955466453 scopus 로고    scopus 로고
    • Minimizing the makespan on a single machine with learning and unequal release times
    • Wu, C.-C., & Liu, C.-L. (2010). Minimizing the makespan on a single machine with learning and unequal release times. Computers & Industrial Engineering, 59, 419-424.
    • (2010) Computers & Industrial Engineering , vol.59 , pp. 419-424
    • Wu, C.-C.1    Liu, C.-L.2
  • 46
    • 78649634113 scopus 로고    scopus 로고
    • Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times
    • Wu, C.-C., Hsu, P.-H., Chen, J.-C., & Wang, N.-S. (2011). Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times. Computers & Operations Research, 38, 1025-1034.
    • (2011) Computers & Operations Research , vol.38 , pp. 1025-1034
    • Wu, C.-C.1    Hsu, P.-H.2    Chen, J.-C.3    Wang, N.-S.4
  • 47
    • 43549109426 scopus 로고    scopus 로고
    • Worst-case analysis for flow shop scheduling with a learning effect
    • Xu, Z., Sun, L., & Gong, J. (2008). Worst-case analysis for flow shop scheduling with a learning effect. International Journal of Production Economics, 113, 748-753.
    • (2008) International Journal of Production Economics , vol.113 , pp. 748-753
    • Xu, Z.1    Sun, L.2    Gong, J.3


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