메뉴 건너뛰기




Volumn 77, Issue , 2014, Pages 15-28

Robust meta-heuristics implementation for unrelated parallel machines scheduling problem with rework processes and machine eligibility restrictions

Author keywords

Machine eligibility restrictions; Meta heuristics; Parameter setting; Rework process; Sequence and machine dependent setup; times; Unrelated parallel machines

Indexed keywords

MACHINE ELIGIBILITY RESTRICTIONS; META HEURISTICS; PARAMETER SETTING; REWORK PROCESS; SEQUENCE AND MACHINE DEPENDENT SETUP; TIMES; UNRELATED PARALLEL MACHINES;

EID: 84907680845     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2014.09.006     Document Type: Article
Times cited : (32)

References (40)
  • 4
    • 58149209970 scopus 로고
    • The competitiveness of on-line assignments
    • Y. Azar, J. Naor, and R. Rom The competitiveness of on-line assignments Journal of Algorithms 18 2 1995 221 237
    • (1995) Journal of Algorithms , vol.18 , Issue.2 , pp. 221-237
    • Azar, Y.1    Naor, J.2    Rom, R.3
  • 6
  • 7
    • 80051545907 scopus 로고    scopus 로고
    • Scheduling with processing set restrictions: PTAS results for several variants
    • L. Epstein, and A. Levin Scheduling with processing set restrictions: PTAS results for several variants International Journal of Production Economics 133 2011 586 595
    • (2011) International Journal of Production Economics , vol.133 , pp. 586-595
    • Epstein, L.1    Levin, A.2
  • 10
    • 23344440689 scopus 로고    scopus 로고
    • Scheduling unit length jobs with parallel nested machine processing set restrictions
    • C.A. Glass, and H.R. Mills Scheduling unit length jobs with parallel nested machine processing set restrictions Computers & Operations Research 33 3 2006 620 638
    • (2006) Computers & Operations Research , vol.33 , Issue.3 , pp. 620-638
    • Glass, C.A.1    Mills, H.R.2
  • 11
    • 77952548983 scopus 로고    scopus 로고
    • Batching for work and rework processes on dedicated facilities to minimize the makespan
    • I. Gribkovskaia, S. Kovalev, and F. Werner Batching for work and rework processes on dedicated facilities to minimize the makespan Omega 38 2010 522 527
    • (2010) Omega , vol.38 , pp. 522-527
    • Gribkovskaia, I.1    Kovalev, S.2    Werner, F.3
  • 12
    • 78549283428 scopus 로고    scopus 로고
    • Unrelated parallel machine scheduling with past-sequence-dependent setup time and learning effects
    • C. Hsu, W. Kuo, and D. Yang Unrelated parallel machine scheduling with past-sequence-dependent setup time and learning effects Applied Mathematical Modelling 35 2011 1492 1496
    • (2011) Applied Mathematical Modelling , vol.35 , pp. 1492-1496
    • Hsu, C.1    Kuo, W.2    Yang, D.3
  • 13
    • 74549151667 scopus 로고    scopus 로고
    • Minimising makespan on parallel machines with precedence constraints and machine eligibility restrictions
    • X. Hu, J. Bao, and Y. Jin Minimising makespan on parallel machines with precedence constraints and machine eligibility restrictions International Journal of Production Research 48 6 2010 1639 1651
    • (2010) International Journal of Production Research , vol.48 , Issue.6 , pp. 1639-1651
    • Hu, X.1    Bao, J.2    Jin, Y.3
  • 14
    • 71649097955 scopus 로고    scopus 로고
    • Parallel machine scheduling with nested processing set restrictions
    • Y. Huo, and J. Leung Parallel machine scheduling with nested processing set restrictions European Journal of Operational Research 204 2010 229 236
    • (2010) European Journal of Operational Research , vol.204 , pp. 229-236
    • Huo, Y.1    Leung, J.2
  • 16
    • 37849187306 scopus 로고    scopus 로고
    • Cost minimizing scheduling of work and rework processes on a single facility under deterioration of reworkables
    • K. Inderfurth, M.Y. Kovalyov, C.T. Ng, and F. Werner Cost minimizing scheduling of work and rework processes on a single facility under deterioration of reworkables International Journal of Production Economics 105 2007 345 356
    • (2007) International Journal of Production Economics , vol.105 , pp. 345-356
    • Inderfurth, K.1    Kovalyov, M.Y.2    Ng, C.T.3    Werner, F.4
  • 18
    • 0036609211 scopus 로고    scopus 로고
    • Unrelated parallel machine scheduling with setup times using simulated annealing
    • D. Kim, K. Kim, W. Jang, and F. Chen Unrelated parallel machine scheduling with setup times using simulated annealing Robotics and Computer Integrated Manufacturing 18 2002 223 231
    • (2002) Robotics and Computer Integrated Manufacturing , vol.18 , pp. 223-231
    • Kim, D.1    Kim, K.2    Jang, W.3    Chen, F.4
  • 19
    • 0037328729 scopus 로고    scopus 로고
    • Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective
    • D. Kim, D. Na, W. Jang, and F. Chen Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective Robotics and Computer Integrated Manufacturing 19 2003 173 181
    • (2003) Robotics and Computer Integrated Manufacturing , vol.19 , pp. 173-181
    • Kim, D.1    Na, D.2    Jang, W.3    Chen, F.4
  • 23
    • 78549251688 scopus 로고    scopus 로고
    • Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems
    • Y. Lin, M. Pfund, and J. Fowler Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems Computers & Operations Research 38 2011 901 916
    • (2011) Computers & Operations Research , vol.38 , pp. 901-916
    • Lin, Y.1    Pfund, M.2    Fowler, J.3
  • 24
    • 84884901057 scopus 로고    scopus 로고
    • On the identical parallel-machine rescheduling with job rework disruption
    • L. Liu, and H. Zhou On the identical parallel-machine rescheduling with job rework disruption Computers & Industrial Engineering 66 1 2013 186 198
    • (2013) Computers & Industrial Engineering , vol.66 , Issue.1 , pp. 186-198
    • Liu, L.1    Zhou, H.2
  • 26
    • 33845466214 scopus 로고    scopus 로고
    • A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness
    • X. Luo, and F. Chu A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness Applied Mathematics and Computation 183 2006 575 588
    • (2006) Applied Mathematics and Computation , vol.183 , pp. 575-588
    • Luo, X.1    Chu, F.2
  • 27
    • 0002643827 scopus 로고
    • Scheduling with deadlines and loss functions
    • R. McNaughton Scheduling with deadlines and loss functions Management Science 6 1959 1 12
    • (1959) Management Science , vol.6 , pp. 1-12
    • McNaughton, R.1
  • 31
    • 84883183651 scopus 로고    scopus 로고
    • Application of Taguchi methods and ANOVA in optimization of process parameters for metal removal rate in electrochemical machining of Al/5%SiC composites
    • S. Rama Rao, and G. Padmanabhan Application of Taguchi methods and ANOVA in optimization of process parameters for metal removal rate in electrochemical machining of Al/5%SiC composites International Journal of Engineering Research and Applications 2 3 2012 192 197
    • (2012) International Journal of Engineering Research and Applications , vol.2 , Issue.3 , pp. 192-197
    • Rama Rao, S.1    Padmanabhan, G.2
  • 33
    • 34548614935 scopus 로고    scopus 로고
    • Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
    • P. Rocha, M. Ravetti, G. Mateus, and P. Pardalos Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times Computers & Operations Research 35 2008 1250 1264
    • (2008) Computers & Operations Research , vol.35 , pp. 1250-1264
    • Rocha, P.1    Ravetti, M.2    Mateus, G.3    Pardalos, P.4
  • 34
    • 67349221528 scopus 로고    scopus 로고
    • Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints
    • R. Tavakkoli-Moghaddam, F. Taheri, M. Bazzazi, M. Izadi, and F. Sassani Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints Computers & Operations Research 36 2009 3224 3230
    • (2009) Computers & Operations Research , vol.36 , pp. 3224-3230
    • Tavakkoli-Moghaddam, R.1    Taheri, F.2    Bazzazi, M.3    Izadi, M.4    Sassani, F.5
  • 35
    • 0038588557 scopus 로고    scopus 로고
    • The value of processing flexibility in multipurpose machines
    • G.L. Vairaktarakis, and X. Cai The value of processing flexibility in multipurpose machines IIE Transactions 35 8 2003 763 774
    • (2003) IIE Transactions , vol.35 , Issue.8 , pp. 763-774
    • Vairaktarakis, G.L.1    Cai, X.2
  • 36
    • 79952187971 scopus 로고    scopus 로고
    • A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times
    • E. Vallada, and R. Ruiz A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times European Journal of Operation Research 211 2011 612 622
    • (2011) European Journal of Operation Research , vol.211 , pp. 612-622
    • Vallada, E.1    Ruiz, R.2
  • 37
    • 0035906316 scopus 로고    scopus 로고
    • Unrelated parallel machine scheduling with setup consideration and a total weighted completion time objective
    • M. Weng, J. Lu, and H. Ren Unrelated parallel machine scheduling with setup consideration and a total weighted completion time objective International Journal of Production Economics 70 2001 215 226
    • (2001) International Journal of Production Economics , vol.70 , pp. 215-226
    • Weng, M.1    Lu, J.2    Ren, H.3
  • 38
    • 33644493766 scopus 로고    scopus 로고
    • A class of generalized multiprocessor scheduling problems
    • X. Yang A class of generalized multiprocessor scheduling problems Systems Science and Mathematical Sciences 13 4 2000 385 390
    • (2000) Systems Science and Mathematical Sciences , vol.13 , Issue.4 , pp. 385-390
    • Yang, X.1
  • 40
    • 0034228084 scopus 로고    scopus 로고
    • Minimizing the sum of earliness-tardiness in multi-machine scheduling: A mixed integer programming approach
    • Z. Zhu, and R.B. Heady Minimizing the sum of earliness-tardiness in multi-machine scheduling: A mixed integer programming approach Computers & Industrial Engineering 38 2000 297 305
    • (2000) Computers & Industrial Engineering , vol.38 , pp. 297-305
    • Zhu, Z.1    Heady, R.B.2


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