메뉴 건너뛰기




Volumn 2013, Issue , 2013, Pages

A hybrid genetic algorithm to minimize total tardiness for unrelated parallel machine scheduling with precedence constraints

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL EXPERIMENT; DETERMINISTIC SCHEDULING; FEASIBLE SCHEDULE; HYBRID GENETIC ALGORITHMS; PRECEDENCE CONSTRAINTS; PUNISHMENT COSTS; TOTAL TARDINESS; UNRELATED PARALLEL MACHINES;

EID: 84881429545     PISSN: 1024123X     EISSN: 15635147     Source Type: Journal    
DOI: 10.1155/2013/537127     Document Type: Article
Times cited : (14)

References (25)
  • 1
    • 33644537918 scopus 로고    scopus 로고
    • Sequencing precedence-related jobs on two machines to minimize the weighted completion time
    • 2-s2.0-33644537918 10.1016/j.ijpe.2004.10.014
    • Ramachandra G., Elmaghraby S. E., Sequencing precedence-related jobs on two machines to minimize the weighted completion time. International Journal of Production Economics 2006 100 1 44 58 2-s2.0-33644537918 10.1016/j.ijpe.2004.10. 014
    • (2006) International Journal of Production Economics , vol.100 , Issue.1 , pp. 44-58
    • Ramachandra, G.1    Elmaghraby, S.E.2
  • 2
    • 33750189214 scopus 로고    scopus 로고
    • Approximation bounds for a general class of precedence constrained parallel machine scheduling problems
    • DOI 10.1137/S0097539799358094
    • Queyranne M., Schulz A. S., Approximation bounds for a general class of precedence constrained parallel machine scheduling problems. SIAM Journal on Computing 2006 35 5 1241 1253 10.1137/S0097539799358094 MR2217144 ZBL1100.68010 (Pubitemid 44599925)
    • (2006) SIAM Journal on Computing , vol.35 , Issue.5 , pp. 1241-1253
    • Queyranne, M.1    Schulz, A.S.2
  • 3
    • 53749099771 scopus 로고    scopus 로고
    • Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints
    • 10.1016/j.cor.2007.10.025 MR2578185 ZBL1163.90006
    • Kim E.-S., Sung C.-S., Lee I.-S., Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints. Computers & Operations Research 2009 36 3 698 710 10.1016/j.cor.2007.10.025 MR2578185 ZBL1163.90006
    • (2009) Computers & Operations Research , vol.36 , Issue.3 , pp. 698-710
    • Kim, E.-S.1    Sung, C.-S.2    Lee, I.-S.3
  • 4
    • 77955274108 scopus 로고    scopus 로고
    • Parallel machine scheduling with precedence constraints and setup times
    • 10.1016/j.cor.2010.03.003 MR2646881 ZBL1231.90192
    • Gacias B., Artigues C., Lopez P., Parallel machine scheduling with precedence constraints and setup times. Computers & Operations Research 2010 37 12 2141 2151 10.1016/j.cor.2010.03.003 MR2646881 ZBL1231.90192
    • (2010) Computers & Operations Research , vol.37 , Issue.12 , pp. 2141-2151
    • Gacias, B.1    Artigues, C.2    Lopez, P.3
  • 5
    • 79958031546 scopus 로고    scopus 로고
    • Variable neighborhood search approaches for scheduling jobs on parallel machines with sequence-dependent setup times, precedence constraints, and ready times
    • 2-s2.0-79958031546 10.1016/j.cie.2010.07.001
    • Driessel R., Mönch L., Variable neighborhood search approaches for scheduling jobs on parallel machines with sequence-dependent setup times, precedence constraints, and ready times. Computers & Industrial Engineering 2011 61 2 336 345 2-s2.0-79958031546 10.1016/j.cie.2010.07.001
    • (2011) Computers & Industrial Engineering , vol.61 , Issue.2 , pp. 336-345
    • Driessel, R.1    Mönch, L.2
  • 6
    • 84865517303 scopus 로고    scopus 로고
    • A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints
    • 10.1016/j.tcs.2012.07.009 MR2961209 ZBL1252.68052
    • Yuan J., Li W., Yuan J., A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints. Theoretical Computer Science 2012 457 174 180 10.1016/j.tcs.2012.07.009 MR2961209 ZBL1252.68052
    • (2012) Theoretical Computer Science , vol.457 , pp. 174-180
    • Yuan, J.1    Li, W.2    Yuan, J.3
  • 7
    • 0032637355 scopus 로고    scopus 로고
    • Scheduling identical jobs with chain precedence constraints on two uniform machines
    • MR1687386 ZBL0941.90019
    • Brucker P., Hurink J., Kubiak W., Scheduling identical jobs with chain precedence constraints on two uniform machines. Mathematical Methods of Operations Research 1999 49 2 211 219 MR1687386 ZBL0941.90019
    • (1999) Mathematical Methods of Operations Research , vol.49 , Issue.2 , pp. 211-219
    • Brucker, P.1    Hurink, J.2    Kubiak, W.3
  • 8
    • 0033882582 scopus 로고    scopus 로고
    • Comment on scheduling on uniform machines under chain-type precedence constraints
    • DOI 10.1016/S0167-6377(99)00076-0
    • Woeginger G. J., A comment on scheduling on uniform machines under chain-type precedence constraints. Operations Research Letters 2000 26 3 107 109 10.1016/S0167-6377(99)00076-0 MR1746804 ZBL0955.90036 (Pubitemid 30564335)
    • (2000) Operations Research Letters , vol.26 , Issue.3 , pp. 107-109
    • Woeginger, G.J.1
  • 9
    • 79955475453 scopus 로고    scopus 로고
    • Scheduling of uniform parallel machines with s-precedence constraints
    • 10.1016/j.mcm.2011.03.001 MR2801911 ZBL1225.90052
    • Kim E.-S., Scheduling of uniform parallel machines with s-precedence constraints. Mathematical and Computer Modelling 2011 54 1-2 576 583 10.1016/j.mcm.2011.03.001 MR2801911 ZBL1225.90052
    • (2011) Mathematical and Computer Modelling , vol.54 , Issue.1-2 , pp. 576-583
    • Kim, E.-S.1
  • 10
    • 80855137982 scopus 로고    scopus 로고
    • An improved monotone algorithm for scheduling related machines with precedence constraints
    • 10.1016/j.orl.2011.07.009 MR2854448 ZBL1235.90070
    • van Zuylen A., An improved monotone algorithm for scheduling related machines with precedence constraints. Operations Research Letters 2011 39 6 423 427 10.1016/j.orl.2011.07.009 MR2854448 ZBL1235.90070
    • (2011) Operations Research Letters , vol.39 , Issue.6 , pp. 423-427
    • Van Zuylen, A.1
  • 11
    • 0031275738 scopus 로고    scopus 로고
    • Heuristics for unrelated machine scheduling with precedence constraints
    • PII S0377221796002470
    • Herrmann J., Proth J.-M., Sauer N., Heuristics for unrelated machine scheduling with precedence constraints. European Journal of Operational Research 1997 102 3 528 537 2-s2.0-0031275738 (Pubitemid 127397089)
    • (1997) European Journal of Operational Research , vol.102 , Issue.3 , pp. 528-537
    • Herrmann, J.1    Proth, J.-M.2    Sauer, N.3
  • 12
    • 66149189213 scopus 로고    scopus 로고
    • Scheduling on unrelated machines under tree-like precedence constraints
    • 10.1007/s00453-007-9004-y MR2506936 ZBL1180.90112
    • Kumar V. S. A., Marathe M. V., Parthasarathy S., Srinivasan A., Scheduling on unrelated machines under tree-like precedence constraints. Algorithmica 2009 55 1 205 226 10.1007/s00453-007-9004-y MR2506936 ZBL1180.90112
    • (2009) Algorithmica , vol.55 , Issue.1 , pp. 205-226
    • Kumar, V.S.A.1    Marathe, M.V.2    Parthasarathy, S.3    Srinivasan, A.4
  • 13
    • 84865086469 scopus 로고    scopus 로고
    • Scheduling tasks with exponential duration on unrelated parallel machines
    • 10.1016/j.dam.2012.06.010 MR2957955 ZBL1248.68121
    • Nouri M., Ghodsi M., Scheduling tasks with exponential duration on unrelated parallel machines. Discrete Applied Mathematics 2012 160 16-17 2462 2473 10.1016/j.dam.2012.06.010 MR2957955 ZBL1248.68121
    • (2012) Discrete Applied Mathematics , vol.160 , Issue.16-17 , pp. 2462-2473
    • Nouri, M.1    Ghodsi, M.2
  • 14
    • 67349149013 scopus 로고    scopus 로고
    • Bottleneck-based heuristics to minimize total tardiness for the flexible flow line with unrelated parallel machines
    • 2-s2.0-67349149013 10.1016/j.cie.2008.08.016
    • Chen C.-L., Chen C.-L., Bottleneck-based heuristics to minimize total tardiness for the flexible flow line with unrelated parallel machines. Computers & Industrial Engineering 2009 56 4 1393 1401 2-s2.0-67349149013 10.1016/j.cie.2008.08.016
    • (2009) Computers & Industrial Engineering , vol.56 , Issue.4 , pp. 1393-1401
    • Chen, C.-L.1    Chen, C.-L.2
  • 15
    • 81555208210 scopus 로고    scopus 로고
    • Minimizing mean weighted tardiness in unrelated parallel machine scheduling with reinforcement learning
    • 10.1016/j.cor.2011.07.019 MR2859530 ZBL1251.68049
    • Zhang Z., Zheng L., Li N., Wang W., Zhong S., Hu K., Minimizing mean weighted tardiness in unrelated parallel machine scheduling with reinforcement learning. Computers & Operations Research 2012 39 7 1315 1324 10.1016/j.cor.2011.07.019 MR2859530 ZBL1251.68049
    • (2012) Computers & Operations Research , vol.39 , Issue.7 , pp. 1315-1324
    • Zhang, Z.1    Zheng, L.2    Li, N.3    Wang, W.4    Zhong, S.5    Hu, K.6
  • 16
    • 0042311378 scopus 로고    scopus 로고
    • Scheduling unrelated parallel machines to minimize total weighted tardiness
    • DOI 10.1016/S0305-0548(02)00105-3, PII S0305054802001053
    • Liaw C.-F., Lin Y.-K., Cheng C.-Y., Chen M., Scheduling unrelated parallel machines to minimize total weighted tardiness. Computers & Operations Research 2003 30 12 1777 1789 10.1016/S0305-0548(02)00105-3 MR2007915 ZBL1047.90021 (Pubitemid 36893352)
    • (2003) Computers and Operations Research , vol.30 , Issue.12 , pp. 1777-1789
    • Liaw, C.-F.1    Lin, Y.-K.2    Cheng, C.-Y.3    Chen, M.4
  • 17
    • 0037328729 scopus 로고    scopus 로고
    • Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective
    • 2-s2.0-0037328729 10.1016/S0736-5845(02)00077-7
    • Kim D.-W., Na D.-G., Chen F. F., Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective. Robotics and Computer-Integrated Manufacturing 2003 19 1-2 173 181 2-s2.0-0037328729 10.1016/S0736-5845(02)00077-7
    • (2003) Robotics and Computer-Integrated Manufacturing , vol.19 , Issue.1-2 , pp. 173-181
    • Kim, D.-W.1    Na, D.-G.2    Chen, F.F.3
  • 18
    • 74849101820 scopus 로고
    • Optimization and approximation in deterministic sequencing and scheduling: A survey
    • MR558574 10.1016/S0167-5060(08)70356-X ZBL0411.90044
    • Graham R. L., Lawler E. L., Lenstra J. K., Rinnooy Kan A. H. G., Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 1979 5 287 326 MR558574 10.1016/S0167-5060(08)70356-X ZBL0411.90044
    • (1979) Annals of Discrete Mathematics , vol.5 , pp. 287-326
    • Graham, R.L.1    Lawler, E.L.2    Lenstra, J.K.3    Rinnooy Kan, A.H.G.4
  • 19
    • 0000474126 scopus 로고
    • Minimizing total tardiness on one machine is NP-hard
    • 10.1287/moor.15.3.483 MR1064213 ZBL0714.90052
    • Du J., Leung J. Y.-T., Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research 1990 15 3 483 495 10.1287/moor.15.3.483 MR1064213 ZBL0714.90052
    • (1990) Mathematics of Operations Research , vol.15 , Issue.3 , pp. 483-495
    • Du, J.1    Leung, J.Y.-T.2
  • 20
    • 10844245552 scopus 로고    scopus 로고
    • A genetic algorithm with sub-indexed partitioning genes and its application to production scheduling of parallel machines
    • DOI 10.1016/j.cie.2004.07.007, PII S0360835204001354
    • Jou C., A genetic algorithm with sub-indexed partitioning genes and its application to production scheduling of parallel machines. Computers & Industrial Engineering 2005 48 1 39 54 2-s2.0-10844245552 10.1016/j.cie.2004.07. 007 (Pubitemid 40003188)
    • (2005) Computers and Industrial Engineering , vol.48 , Issue.1 SPEC. ISSUE. , pp. 39-54
    • Jou, C.1
  • 21
    • 67349221528 scopus 로고    scopus 로고
    • Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints
    • 2-s2.0-67349221528 10.1016/j.cor.2009.02.012
    • Tavakkoli-Moghaddam R., Taheri F., Bazzazi M., Izadi M., Sassani F., Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints. Computers and Operations Research 2009 36 12 3224 3230 2-s2.0-67349221528 10.1016/j.cor.2009.02.012
    • (2009) Computers and Operations Research , vol.36 , Issue.12 , pp. 3224-3230
    • Tavakkoli-Moghaddam, R.1    Taheri, F.2    Bazzazi, M.3    Izadi, M.4    Sassani, F.5
  • 22
    • 52049091896 scopus 로고    scopus 로고
    • A memetic algorithm for the flexible flow line scheduling problem with processor blocking
    • 10.1016/j.cor.2007.10.011 MR2579928 ZBL1157.90428
    • Tavakkoli-Moghaddam R., Safaei N., Sassani F., A memetic algorithm for the flexible flow line scheduling problem with processor blocking. Computers & Operations Research 2009 36 2 402 414 10.1016/j.cor.2007.10.011 MR2579928 ZBL1157.90428
    • (2009) Computers & Operations Research , vol.36 , Issue.2 , pp. 402-414
    • Tavakkoli-Moghaddam, R.1    Safaei, N.2    Sassani, F.3
  • 23
    • 79959578665 scopus 로고    scopus 로고
    • A hybrid genetic algorithm for integrated project task and multi-skilled workforce scheduling
    • 2-s2.0-79959578665
    • Liu C., Yang S., A hybrid genetic algorithm for integrated project task and multi-skilled workforce scheduling. Journal of Computational Information Systems 2011 7 6 2187 2194 2-s2.0-79959578665
    • (2011) Journal of Computational Information Systems , vol.7 , Issue.6 , pp. 2187-2194
    • Liu, C.1    Yang, S.2
  • 24
    • 0033079828 scopus 로고    scopus 로고
    • Early/tardy scheduling with sequence dependent setups on uniform parallel machines
    • DOI 10.1016/S0305-0548(98)00051-3, PII S0305054898000513
    • Balakrishnan N., Kanet J. J., Sridharan V., Early/tardy scheduling with sequence dependent setups on uniform parallel machines. Computers & Operations Research 1999 26 2 127 141 10.1016/S0305-0548(98)00051-3 MR1656838 ZBL0947.90043 (Pubitemid 29346480)
    • (1999) Computers and Operations Research , vol.26 , Issue.2 , pp. 127-141
    • Balakrishnan, N.1    Kanet, J.J.2    Sridharan, S.V.3
  • 25
    • 0035521426 scopus 로고    scopus 로고
    • Generating experimental data for computational testing with machine scheduling applications
    • Hall N. G., Posner M. E., Generating experimental data for computational testing with machine scheduling applications. Operations Research 2001 49 6 854 865 10.1287/opre.49.6.854.10014 MR1876965 ZBL1163.90490 (Pubitemid 34271873)
    • (2001) Operations Research , vol.49 , Issue.6 , pp. 854-865
    • Hall, N.G.1    Posner, M.E.2


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