메뉴 건너뛰기




Volumn 55, Issue 1-4, 2011, Pages 341-353

Branch-and-bound and simulated annealing algorithms for a total weighted completion time scheduling with ready times and learning effect

Author keywords

Learning effect; Ready time; Scheduling; Simulated annealing

Indexed keywords

AVERAGE ERRORS; BRANCH AND BOUNDS; BRANCH-AND-BOUND ALGORITHMS; LEARNING EFFECTS; READY TIME; SIMULATED ANNEALING ALGORITHMS; SINGLE MACHINES; TOTAL WEIGHTED COMPLETION TIME; UNEQUAL READY TIME; WAFER FABRICATIONS;

EID: 79958780796     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-010-3022-7     Document Type: Article
Times cited : (5)

References (39)
  • 3
    • 0345201636 scopus 로고    scopus 로고
    • Single-machine scheduling with learning considerations
    • 0946.90025 10.1016/S0377-2217(98)00246-X
    • D Biskup 1999 Single-machine scheduling with learning considerations Eur J Oper Res 115 173 178 0946.90025 10.1016/S0377-2217(98)00246-X
    • (1999) Eur J Oper Res , vol.115 , pp. 173-178
    • Biskup, D.1
  • 4
    • 0034563358 scopus 로고    scopus 로고
    • Single Machine Scheduling with Learning Effect Considerations
    • DOI 10.1023/A:1019216726076
    • TCE Cheng G Wang 2000 Single machine scheduling with learning effect considerations Ann Oper Res 98 273 290 1839885 0967.68019 10.1023/A: 1019216726076 (Pubitemid 33282737)
    • (2000) Annals of Operations Research , vol.98 , Issue.1-4 , pp. 273-290
    • Cheng, T.C.E.1    Wang, G.2
  • 5
    • 40849111346 scopus 로고    scopus 로고
    • Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
    • 2416993 1172.90397 10.1016/j.ins.2008.02.002
    • TCE Cheng CC Wu WC Lee 2008 Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects Inf Sci 178 2476 2487 2416993 1172.90397 10.1016/j.ins.2008.02.002
    • (2008) Inf Sci , vol.178 , pp. 2476-2487
    • Cheng, T.C.E.1    Wu, C.C.2    Lee, W.C.3
  • 6
    • 37349025024 scopus 로고    scopus 로고
    • Single-machine scheduling with a time-dependent learning effect
    • DOI 10.1016/j.ijpe.2007.03.013, PII S0925527307001661
    • JB Wang CT Ng TCE Cheng LL Liu 2008 Single-machine scheduling with a time-dependent learning effect Int J Prod Econ 111 802 811 10.1016/j.ijpe.2007. 03.013 (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
  • 7
    • 77953613682 scopus 로고    scopus 로고
    • Some single-machine scheduling problems with past-sequence-dependent setup times and a general learning effect
    • 10.1007/s00170-009-2360-9
    • Y Yin D Xu J Wang 2010 Some single-machine scheduling problems with past-sequence-dependent setup times and a general learning effect Int J Adv Manuf Technol 48 1123 1132 10.1007/s00170-009-2360-9
    • (2010) Int J Adv Manuf Technol , vol.48 , pp. 1123-1132
    • Yin, Y.1    Xu, D.2    Wang, J.3
  • 8
    • 71849087769 scopus 로고    scopus 로고
    • Single-machine scheduling with learning effect and deteriorating jobs
    • 10.1016/j.cie.2009.07.015
    • JB Wang 2009 Single-machine scheduling with learning effect and deteriorating jobs Comput Ind Eng 57 1452 1456 10.1016/j.cie.2009.07.015
    • (2009) Comput Ind Eng , vol.57 , pp. 1452-1456
    • Wang, J.B.1
  • 9
    • 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 R Rudek 2008 A new approach to the learning effect: beyond the learning curve restrictions Comput Oper Res 35 3727 3736 2586459 1170.90392 10.1016/j.cor.2007.04.007 (Pubitemid 351443072)
    • (2008) Computers and Operations Research , vol.35 , Issue.11 , pp. 3727-3736
    • Janiak, A.1    Rudek, R.2
  • 10
    • 67549084335 scopus 로고    scopus 로고
    • Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning
    • 1185.90097 10.1016/j.mcm.2009.05.026
    • MD Toksari D Oron E Güner 2009 Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning Math Comput Modell 50 401 406 1185.90097 10.1016/j.mcm.2009.05.026
    • (2009) Math Comput Modell , vol.50 , pp. 401-406
    • Toksari, M.D.1    Oron, D.2    Güner, E.3
  • 11
    • 43549109426 scopus 로고    scopus 로고
    • Worst-case analysis for flow shop scheduling with a learning effect
    • 10.1016/j.ijpe.2007.11.002
    • Z Xu L Sun J Gong 2008 Worst-case analysis for flow shop scheduling with a learning effect Int J Prod Econ 113 748 753 10.1016/j.ijpe.2007.11.002
    • (2008) Int J Prod Econ , vol.113 , pp. 748-753
    • Xu, Z.1    Sun, L.2    Gong, J.3
  • 12
    • 67349111349 scopus 로고    scopus 로고
    • Solution algorithms for the makespan minimization problem with the general learning model
    • 10.1016/j.cie.2008.07.019
    • A Janiak WA Janiak R Rudek A Wielgus 2009 Solution algorithms for the makespan minimization problem with the general learning model Comput Ind Eng 56 4 1301 1308 10.1016/j.cie.2008.07.019
    • (2009) Comput Ind Eng , vol.56 , Issue.4 , pp. 1301-1308
    • Janiak, A.1    Janiak, W.A.2    Rudek, R.3    Wielgus, A.4
  • 13
    • 77953616115 scopus 로고    scopus 로고
    • Scheduling with past- sequence- dependent setup times and learning effects on a single machine
    • 10.1007/s00170-009-2308-0
    • XR Wang JB Wang WJ Gao X Huang 2010 Scheduling with past- sequence- dependent setup times and learning effects on a single machine Int J Adv Manuf Technol 48 739 746 10.1007/s00170-009-2308-0
    • (2010) Int J Adv Manuf Technol , vol.48 , pp. 739-746
    • Wang, X.R.1    Wang, J.B.2    Gao, W.J.3    Huang, X.4
  • 14
    • 77954212656 scopus 로고    scopus 로고
    • Two-agent single-machine scheduling with position-dependent processing times
    • 10.1007/s00170-009-2259-5
    • P Liu X Zhou L Tang 2010 Two-agent single-machine scheduling with position-dependent processing times Int J Adv Manuf Technol 48 325 331 10.1007/s00170-009-2259-5
    • (2010) Int J Adv Manuf Technol , vol.48 , pp. 325-331
    • Liu, P.1    Zhou, X.2    Tang, L.3
  • 15
    • 79955648696 scopus 로고    scopus 로고
    • Single-machine scheduling with controllable processing times and learning effect
    • 10.1007/s00170-010-2973-z
    • N Yin XY Wang 2010 Single-machine scheduling with controllable processing times and learning effect Int J Adv Manuf Technol 10.1007/s00170-010-2973-z
    • (2010) Int J Adv Manuf Technol
    • Yin, N.1    Wang, X.Y.2
  • 16
    • 38149027740 scopus 로고    scopus 로고
    • A state-of-the-art review on scheduling with learning effect
    • 2384086 1129.90022 10.1016/j.ejor.2007.05.040
    • D Biskup 2008 A state-of-the-art review on scheduling with learning effect Eur J Oper Res 188 315 329 2384086 1129.90022 10.1016/j.ejor.2007.05.040
    • (2008) Eur J Oper Res , vol.188 , pp. 315-329
    • Biskup, D.1
  • 17
    • 0032156495 scopus 로고    scopus 로고
    • Scheduling identical jobs with unequal ready times on uniform parallel machines to minimize the maximum lateness
    • 1662359 10.1016/S0360-8352(98)00105-3
    • MM Dessouky 1998 Scheduling identical jobs with unequal ready times on uniform parallel machines to minimize the maximum lateness Comput Ind Eng 34 4 793 806 1662359 10.1016/S0360-8352(98)00105-3
    • (1998) Comput Ind Eng , vol.34 , Issue.4 , pp. 793-806
    • Dessouky, M.M.1
  • 18
    • 2342451996 scopus 로고    scopus 로고
    • Scheduling jobs with position-dependent processing times
    • 1095.90033 10.1057/palgrave.jors.2601689
    • A Bachman A Janiak 2004 Scheduling jobs with position-dependent processing times J Oper Res Soc 55 257 264 1095.90033 10.1057/palgrave.jors. 2601689
    • (2004) J Oper Res Soc , vol.55 , pp. 257-264
    • Bachman, A.1    Janiak, A.2
  • 19
    • 69549130676 scopus 로고    scopus 로고
    • A single-machine learning effect scheduling problem with release times
    • 10.1016/j.omega.2009.01.001
    • WC Lee CC Wu PH Hsu 2010 A single-machine learning effect scheduling problem with release times Omega 38 3 11 10.1016/j.omega.2009.01.001
    • (2010) Omega , vol.38 , pp. 3-11
    • Lee, W.C.1    Wu, C.C.2    Hsu, P.H.3
  • 20
    • 58849106666 scopus 로고    scopus 로고
    • Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect
    • 2493393 1155.90380 10.1016/j.amc.2008.12.001
    • T Eren 2009 Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect Appl Math Comput 208 355 358 2493393 1155.90380 10.1016/j.amc.2008.12.001
    • (2009) Appl Math Comput , vol.208 , pp. 355-358
    • Eren, T.1
  • 21
    • 67349134227 scopus 로고    scopus 로고
    • A single-machine bi-criterion learning scheduling problem with release times
    • 10.1016/j.eswa.2009.01.047
    • WC Lee CC Wu MF Liu 2009 A single-machine bi-criterion learning scheduling problem with release times Expert Syst Appl 36 10295 10303 10.1016/j.eswa.2009.01.047
    • (2009) Expert Syst Appl , vol.36 , pp. 10295-10303
    • Lee, W.C.1    Wu, C.C.2    Liu, M.F.3
  • 22
    • 77956273197 scopus 로고    scopus 로고
    • Branch-and-bound algorithms for maximizing expected improvement
    • 2719476 1197.62117 10.1016/j.jspi.2010.05.011
    • M Franey P Ranjan H Chipman 2011 Branch-and-bound algorithms for maximizing expected improvement J Stat Plan Inference 141 1 42 55 2719476 1197.62117 10.1016/j.jspi.2010.05.011
    • (2011) J Stat Plan Inference , vol.141 , Issue.1 , pp. 42-55
    • Franey, M.1    Ranjan, P.2    Chipman, H.3
  • 23
    • 38749089769 scopus 로고    scopus 로고
    • Efficient branch-and-bound algorithm for minimizing the weighted sum of completion times on a single machine with one availability constraint
    • DOI 10.1016/j.ijpe.2007.01.013, PII S0925527307001326
    • I Kacem C Chu 2008 Efficient branch-and-bound algorithm for minimizing the weighted sum of completion times on a single machine with one availability constraint Int J Prod Econ 112 1 138 150 10.1016/j.ijpe.2007.01.013 (Pubitemid 351179596)
    • (2008) International Journal of Production Economics , vol.112 , Issue.1 , pp. 138-150
    • Kacem, I.1    Chu, C.2
  • 24
    • 79955644306 scopus 로고    scopus 로고
    • A branch-and-bound and heuristic algorithm for the single-machine time-dependent scheduling problem
    • 10.1007/s00170-009-2232-3
    • WC Lee YS Lin CC Wu 2010 A branch-and-bound and heuristic algorithm for the single-machine time-dependent scheduling problem Int J Adv Manuf Technol 47 9-12 1217 1223 10.1007/s00170-009-2232-3
    • (2010) Int J Adv Manuf Technol , vol.47 , Issue.912 , pp. 1217-1223
    • Lee, W.C.1    Lin, Y.S.2    Wu, C.C.3
  • 25
    • 68249112312 scopus 로고    scopus 로고
    • A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
    • 2577261 1171.90404 10.1016/j.cor.2009.03.019
    • CT Ng JB Wang TCE Cheng LL Liu 2010 A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs Comput Oper Res 37 1 83 90 2577261 1171.90404 10.1016/j.cor.2009.03.019
    • (2010) Comput Oper Res , vol.37 , Issue.1 , pp. 83-90
    • Ng, C.T.1    Wang, J.B.2    Cheng, T.C.E.3    Liu, L.L.4
  • 26
    • 44449177594 scopus 로고    scopus 로고
    • A branch-and-bound parallel algorithm for single-machine total weighted tardiness problem
    • DOI 10.1007/s00170-007-1023-y
    • M Wodecki 2008 A branch-and-bound parallel algorithm for single-machine total weighted tardiness problem Int J Adv Manuf Technol 37 9-10 996 1004 10.1007/s00170-007-1023-y (Pubitemid 351768707)
    • (2008) International Journal of Advanced Manufacturing Technology , vol.37 , Issue.9-10 , pp. 996-1004
    • Wodecki, M.1
  • 27
    • 55649112933 scopus 로고    scopus 로고
    • A branch-and-bound algorithm for two-sided assembly line balancing
    • 10.1007/s00170-007-1286-3
    • EF Wu Y Jin JS Bao XF Hu 2008 A branch-and-bound algorithm for two-sided assembly line balancing Int J Adv Manuf Technol 39 9-10 1009 1015 10.1007/s00170-007-1286-3
    • (2008) Int J Adv Manuf Technol , vol.39 , Issue.910 , pp. 1009-1015
    • Wu, E.F.1    Jin, Y.2    Bao, J.S.3    Hu, X.F.4
  • 28
    • 77951139709 scopus 로고
    • Complexity of machine scheduling problems
    • 456421 10.1016/S0167-5060(08)70743-X
    • JK Lenstra AHG Rinnooy Kan P Brucker 1977 Complexity of machine scheduling problems Ann Discrete Math 1 343 362 456421 10.1016/S0167-5060(08) 70743-X
    • (1977) Ann Discrete Math , vol.1 , pp. 343-362
    • Lenstra, J.K.1    Rinnooy Kan, A.H.G.2    Brucker, P.3
  • 30
    • 26444479778 scopus 로고
    • Optimization by simulated annealing
    • 702485 10.1126/science.220.4598.671
    • S Kirkpatrick C Gelatt M Vecchi 1983 Optimization by simulated annealing Science 220 4598 671 680 702485 10.1126/science.220.4598.671
    • (1983) Science , vol.220 , Issue.4598 , pp. 671-680
    • Kirkpatrick, S.1    Gelatt, C.2    Vecchi, M.3
  • 31
    • 79955655281 scopus 로고    scopus 로고
    • A hybrid algorithm based on particle swarm optimization and simulated annealing for a periodic job shop scheduling problem
    • 10.1007/s00170-010-2932-8
    • A Jamili MA Shafia R Tavakkoli-Moghaddam 2010 A hybrid algorithm based on particle swarm optimization and simulated annealing for a periodic job shop scheduling problem Int J Adv Manuf Technol 10.1007/s00170-010-2932-8
    • (2010) Int J Adv Manuf Technol
    • Jamili, A.1    Shafia, M.A.2    Tavakkoli-Moghaddam, R.3
  • 32
    • 67349215094 scopus 로고    scopus 로고
    • Cloud theory-based simulated annealing algorithm and application
    • 10.1016/j.engappai.2009.03.003
    • P Lv L Yuan J Zhang 2009 Cloud theory-based simulated annealing algorithm and application Eng Appl Artif Intell 22 4-5 742 749 10.1016/j.engappai.2009. 03.003
    • (2009) Eng Appl Artif Intell , vol.22 , Issue.45 , pp. 742-749
    • Lv, P.1    Yuan, L.2    Zhang, J.3
  • 34
    • 77249154553 scopus 로고    scopus 로고
    • Reverse logistics network design using simulated annealing
    • 10.1007/s00170-009-2194-5
    • MS Pishvaee K Kianfar B Karimi 2010 Reverse logistics network design using simulated annealing Int J Adv Manuf Technol 47 1-4 269 281 10.1007/s00170-009-2194-5
    • (2010) Int J Adv Manuf Technol , vol.47 , Issue.14 , pp. 269-281
    • Pishvaee, M.S.1    Kianfar, K.2    Karimi, B.3
  • 35
    • 77956192224 scopus 로고    scopus 로고
    • Orthogonal simulated annealing for multiobjective optimization
    • 10.1016/j.compchemeng.2009.11.015
    • B Suman N Hoda S Jha 2010 Orthogonal simulated annealing for multiobjective optimization Comput Chem Eng 34 10 1618 1631 10.1016/j. compchemeng.2009.11.015
    • (2010) Comput Chem Eng , vol.34 , Issue.10 , pp. 1618-1631
    • Suman, B.1    Hoda, N.2    Jha, S.3
  • 36
    • 77956619682 scopus 로고    scopus 로고
    • Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop
    • 1201.90086 10.1016/j.advengsoft.2010.06.004
    • E Torabzadeh M Zandieh 2010 Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop Adv Eng Softw 41 10-11 1238 1243 1201.90086 10.1016/j.advengsoft.2010.06.004
    • (2010) Adv Eng Softw , vol.41 , Issue.1011 , pp. 1238-1243
    • Torabzadeh, E.1    Zandieh, M.2
  • 37
    • 79953039544 scopus 로고    scopus 로고
    • A simulated annealing for hybrid flow shop scheduling with multiprocessor tasks to minimize makespan
    • 10.1007/s00170-010-2868-z
    • HM Wang FD Chou FC Wu 2010 A simulated annealing for hybrid flow shop scheduling with multiprocessor tasks to minimize makespan Int J Adv Manuf Technol 10.1007/s00170-010-2868-z
    • (2010) Int J Adv Manuf Technol
    • Wang, H.M.1    Chou, F.D.2    Wu, F.C.3
  • 38
    • 0003279343 scopus 로고
    • Annealing method for PCB assembly scheduling on two sequential machines
    • 10.1080/09511929208944543
    • D Ben-Arieh O Maimon 1992 Annealing method for PCB assembly scheduling on two sequential machines Int J Computer Integr Manuf 5 361 367 10.1080/09511929208944543
    • (1992) Int J Computer Integr Manuf , vol.5 , pp. 361-367
    • Ben-Arieh, D.1    Maimon, O.2
  • 39
    • 0029196383 scopus 로고
    • Heuristics for scheduling a single machine subject to unequal job release times
    • 10.1016/0377-2217(93)E0290-E
    • C Reever 1995 Heuristics for scheduling a single machine subject to unequal job release times Eur J Oper Res 80 397 403 10.1016/0377-2217(93)E0290-E
    • (1995) Eur J Oper Res , vol.80 , pp. 397-403
    • Reever, C.1


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