$\require{mediawiki-texvc}$

연합인증

연합인증 가입 기관의 연구자들은 소속기관의 인증정보(ID와 암호)를 이용해 다른 대학, 연구기관, 서비스 공급자의 다양한 온라인 자원과 연구 데이터를 이용할 수 있습니다.

이는 여행자가 자국에서 발행 받은 여권으로 세계 각국을 자유롭게 여행할 수 있는 것과 같습니다.

연합인증으로 이용이 가능한 서비스는 NTIS, DataON, Edison, Kafe, Webinar 등이 있습니다.

한번의 인증절차만으로 연합인증 가입 서비스에 추가 로그인 없이 이용이 가능합니다.

다만, 연합인증을 위해서는 최초 1회만 인증 절차가 필요합니다. (회원이 아닐 경우 회원 가입이 필요합니다.)

연합인증 절차는 다음과 같습니다.

최초이용시에는
ScienceON에 로그인 → 연합인증 서비스 접속 → 로그인 (본인 확인 또는 회원가입) → 서비스 이용

그 이후에는
ScienceON 로그인 → 연합인증 서비스 접속 → 서비스 이용

연합인증을 활용하시면 KISTI가 제공하는 다양한 서비스를 편리하게 이용하실 수 있습니다.

[해외논문] A heuristic algorithm for identical parallel machine scheduling: splitting jobs, sequence-dependent setup times, and limited setup operators

Flexible services and manufacturing journal, v.33 no.4, 2021년, pp.992 - 1026  

Lee, Jun-Ho ,  Kim, Hyun-Jung

초록이 없습니다.

참고문헌 (47)

  1. Comput Oper Res AH Abdekhodaee 33 4 994 2006 10.1016/j.cor.2004.08.013 Abdekhodaee AH, Wirth A, Gen H-S (2006) Scheduling two parallel machines with a single server: the general case. Comput Oper Res 33(4):994-1009 

  2. Int J Adv Manuf Technol O Avalos-Rosales 76 9 1705 2015 10.1007/s00170-014-6390-6 Avalos-Rosales O, Angel-Bello F, Alvarez A (2015) Efficient metaheuristic algorithm and re-formulations for the unrelated parallel machine scheduling problem with sequence and machine-dependent setup times. Int J Adv Manuf Technol 76(9):1705-1718 

  3. Expert Syst Appl J Behnamian 36 6 9637 2009 10.1016/j.eswa.2008.10.007 Behnamian J, Zandieh M, Fatemi Ghomi SMT (2009) Parallel-machine scheduling problems with sequence-dependent setup times using an ACO, SA, and VNS hybrid algorithm. Expert Syst Appl 36(6):9637-9644 

  4. Comput Oper Res G Bektur 103 46 2019 10.1016/j.cor.2018.10.010 Bektur G, Saraç T (2019) A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server. Comput Oper Res 103:46-63 

  5. J Sched P Brucker 5 429 2002 10.1002/jos.120 Brucker P, Dhaenens-Filpo C, Knust S, Kravchenko SA, Werner F (2002) Complexity results for parallel machine problems with a single server. J Sched 5:429-457 

  6. Eur J Oper Res TCE Cheng 47 3 271 1990 10.1016/0377-2217(90)90215-W Cheng TCE, Sin CCS (1990) A state-of-the-art review of parallel-machine scheduling research. Eur J Oper Res 47(3):271-292 

  7. Eur J Oper Res EB Edis 230 3 449 2013 10.1016/j.ejor.2013.02.042 Edis EB, Ogus C, Ozkarahan I (2013) Parallel machine scheduling with additional resources: notation, classification, models and solution methods. Eur J Oper Res 230(3):449-463 

  8. Comput Oper Res A Ekici 111 130 2019 10.1016/j.cor.2019.06.007 Ekici A, Elyasi M, Özener OÖ, Sarikaya MB (2019) An application of unrelated parallel machine scheduling with sequence-dependent setups at vestel electronics. Comput Oper Res 111:130-140 

  9. Int J Prod Res DY Eroglu 52 19 5841 2014 10.1080/00207543.2014.920966 Eroglu DY, Ozmutlu HC, Ozmutlu S (2014) Genetic algorithm with local search for the unrelated parallel machine scheduling problem with sequence-dependent set-up times. Int J Prod Res 52(19):5841-5856 

  10. Asia Pac J Oper Res M Ethel 18 2 193 2001 Ethel M (2001) Parallel machine scheduling problems: a survey. Asia Pac J Oper Res 18(2):193-242 

  11. SIAM J Appl Math DK Friesen 16 3 554 1987 Friesen DK (1987) Tighter bounds for lpt scheduling on uniform processors. SIAM J Appl Math 16(3):554-560 

  12. SIAM J Appl Math RL Graham 17 2 416 1969 10.1137/0117039 Graham RL (1969) Bounds on multiprocessing timing anomalies. SIAM J Appl Math 17(2):416-429 

  13. Discrete Appl Math NG Hall 102 3 223 2000 10.1016/S0166-218X(99)00206-1 Hall NG, Potts CN, Sriskandarajah C (2000) Parallel machine scheduling with a common server. Discrete Appl Math 102(3):223-243 

  14. Comput Ind Eng A Hamzadayi 106 287 2017 10.1016/j.cie.2017.02.013 Hamzadayi A, Yildiz G (2017) Modeling and solving static m identical parallel machines scheduling problem with a common server and sequence dependent setup times. Comput Ind Eng 106:287-298 

  15. Int J Prod Res K Hasani 52 13 3778 2014 10.1080/00207543.2013.874607 Hasani K, Kravchenko SA, Werner F (2014) Simulated annealing and genetic algorithms for the two-machine scheduling problem with a single server. Int J Prod Res 52(13):3778-3792 

  16. Ann Oper Res H-J Kim 261 1-2 401 2018 10.1007/s10479-017-2615-z Kim H-J (2018) Bounds for parallel machine scheduling with predefined parts of jobs and setup times. Ann Oper Res 261(1-2):401-412 

  17. Comput Oper Res H-J Kim 126 105115 2021 10.1016/j.cor.2020.105115 Kim H-J, Lee J-H (2021) Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers. Comput Oper Res 126:105115 

  18. Int J Prod Res Y-D Kim 42 21 4531 2004 10.1080/00207540410001720745 Kim Y-D, Shim S-O, Kim S-B, Choi Y-C, Yoon H (2004) Parallel machine scheduling considering a job-splitting property. Int J Prod Res 42(21):4531-4546 

  19. Comput Oper Res CP Koulamas 23 10 945 1996 10.1016/0305-0548(96)00011-1 Koulamas CP (1996) Scheduling two parallel semiautomatic machines to minimize machine interference. Comput Oper Res 23(10):945-956 

  20. Math Comput Modell CP Koulamas 26 12 1 1997 10.1016/S0895-7177(97)00236-7 Koulamas CP (1997) Parallel machine scheduling problems with a single server. Math Comput Modell 26(12):1-11 

  21. 10.1080/01605682.2019.1700191 Lee J-H, Jang H, Kim H-J (2020) Iterative job splitting algorithms for parallel machine scheduling with job splitting and setup resource constraints. J Oper Res Soc 

  22. Eur J Oper Res YH Lee 100 3 464 1997 10.1016/S0377-2217(95)00376-2 Lee YH, Pinedo M (1997) Scheduling jobs on parallel machines with sequence-dependent setup times. Eur J Oper Res 100(3):464-474 

  23. Inf Process Lett S-S Li 114 12 692 2014 10.1016/j.ipl.2014.06.009 Li S-S, Zhang Y-Z (2014) Serial batch scheduling on uniform parallel machines to minimize total completion time. Inf Process Lett 114(12):692-695 

  24. Comput Oper Res S-W Lin 51 172 2014 10.1016/j.cor.2014.05.013 Lin S-W, Ying K-C (2014) Abc-based manufacturing scheduling for unrelated parallel machines with machine-dependent and job sequence-dependent setup times. Comput Oper Res 51:172-181 

  25. J Oper Res Soc G-S Liu 70 9 1554 2019 10.1080/01605682.2018.1500976 Liu G-S, Li J-J, Yang H-D, Huang GQ (2019) Approximate and branch-and-bound algorithms for the parallel machine scheduling problem with a single server. J Oper Res Soc 70(9):1554-1570 

  26. IIE Trans R Logendran 36 4 359 2004 10.1080/07408170490279598 Logendran R, Subur F (2004) Unrelated parallel machine scheduling with job splitting. IIE Trans 36(4):359-372 

  27. Oper Res Lett IM Ovacik 14 5 251 1993 10.1016/0167-6377(93)90089-Y Ovacik IM, Uzsoy R (1993) Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times. Oper Res Lett 14(5):251-256 

  28. Int J Prod Res IM Ovacik 33 11 3173 1995 10.1080/00207549508904867 Ovacik IM, Uzsoy R (1995) Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times. Int J Prod Res 33(11):3173-3192 

  29. Int J Adv Manuf Technol T Park 59 1 325 2012 10.1007/s00170-011-3489-x Park T, Lee T, Kim CO (2012) Due-date scheduling on parallel machines with job splitting and sequence-dependent major/minor setup times. Int J Adv Manuf Technol 59(1):325-333 

  30. Ann Oper Res J Pei 272 1 217 2019 10.1007/s10479-017-2481-8 Pei J, Cheng B, Liu X, Pardalos PM, Kong M (2019) Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time. Ann Oper Res 272(1):217-241 

  31. ML Pinedo 2012 Scheduling theory, algorithms, and systems Pinedo ML (2012) Scheduling theory, algorithms, and systems. Springer, New York 

  32. Int J Prod Res S Radhakrishnan 38 10 2233 2010 10.1080/00207540050028070 Radhakrishnan S, Ventura JA (2010) Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent setup times. Int J Prod Res 38(10):2233-2252 

  33. Appl Math Model İ Sariçiçek 35 8 4117 2011 10.1016/j.apm.2011.02.035 Sariçiçek İ, Çelik C (2011) Two meta-heuristics for parallel machine scheduling with job splitting to minimize total tardiness. Appl Math Model 35(8):4117-4126 

  34. Oper Res P Serafini 44 4 617 1996 10.1287/opre.44.4.617 Serafini P (1996) Scheduling jobs on several machines with the job splitting property. Oper Res 44(4):617-628 

  35. Ann Oper Res L Shen 206 1 425 2013 10.1007/s10479-013-1339-y Shen L, Mönch L, Buscher U (2013) An iterative approach for the serial batching problem with parallel machines and job families. Ann Oper Res 206(1):425-448 

  36. Comput Oper Res S-O Shim 35 3 863 2008 10.1016/j.cor.2006.04.006 Shim S-O, Kim Y-D (2008) A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property. Comput Oper Res 35(3):863-875 

  37. Int J Prod Econ DN Tahar 99 1-2 63 2006 10.1016/j.ijpe.2004.12.007 Tahar DN, Yalaoui F, Chu C, Amodeo L (2006) A linear programming approach for identical parallel machine scheduling with job splitting and sequence-dependent setup times. Int J Prod Econ 99(1-2):63-73 

  38. Eur J Oper Res E Vallada 211 3 612 2011 10.1016/j.ejor.2011.01.011 Vallada E, Ruiz R (2011) A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times. Eur J Oper Res 211(3):612-622 

  39. Comput Ind Eng C Wang 97 170 2012 10.1016/j.cie.2016.05.001 Wang C, Liu C, Zhang Z-H, Zheng L (2012) Minimizing the total completion time for parallel machine scheduling with job splitting and learning. Comput Ind Eng 97:170-182 

  40. J Oper Res Soc G Wang 52 2 234 2001 10.1057/palgrave.jors.2601074 Wang G, Cheng TCE (2001) An approximation algorithm for parallel machine scheduling with a common server. J Oper Res Soc 52(2):234-237 

  41. Flex Serv Manuf J I-L Wang 25 343 2013 10.1007/s10696-012-9150-7 Wang I-L, Wang Y-C, Chen C-W (2013) Scheduling unrelated parallel machines in semiconductor manufacturing by problem reduction and local search heuristics. Flex Serv Manuf J 25:343-366 

  42. Comput Oper Res W-L Wang 40 5 1196 2013 10.1016/j.cor.2012.12.007 Wang W-L, Wang H-Y, Zhao Y-W, Zhang L-P, Xu X-L (2013) Parallel machine scheduling with splitting jobs by a hybrid differential evolution algorithm. Comput Oper Res 40(5):1196-1206 

  43. Autom Remote Control F Werner 71 10 2109 2010 10.1134/S0005117910100103 Werner F, Kravchenko SA (2010) Scheduling with multiple servers. Autom Remote Control 71(10):2109-2121 

  44. Flex Serv Manuf J RJ Wittrock 2 4 329 1990 Wittrock RJ (1990) Scheduling parallel machines with major and minor setup times. Flex Serv Manuf J 2(4):329-341 

  45. Comput Oper Res J Xiao 63 72 2015 10.1016/j.cor.2015.04.010 Xiao J, Yang H, Zhang C, Zheng L, Gupta JND (2015) A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times. Comput Oper Res 63:72-82 

  46. Discrete Appl Math W Xing 103 1-3 259 2000 10.1016/S0166-218X(00)00176-1 Xing W, Zhang J (2000) Parallel machine scheduling with splitting jobs. Discrete Appl Math 103(1-3):259-269 

  47. IIE Trans F Yalaoui 35 2 183 2003 10.1080/07408170304382 Yalaoui F, Chu C (2003) An efficient heuristic approach for parallel machine scheduling with job splitting and sequence-dependent setup times. IIE Trans 35(2):183-190 

LOADING...

활용도 분석정보

상세보기
다운로드
내보내기

활용도 Top5 논문

해당 논문의 주제분야에서 활용도가 높은 상위 5개 콘텐츠를 보여줍니다.
더보기 버튼을 클릭하시면 더 많은 관련자료를 살펴볼 수 있습니다.

관련 콘텐츠

유발과제정보 저작권 관리 안내
섹션별 컨텐츠 바로가기

AI-Helper ※ AI-Helper는 오픈소스 모델을 사용합니다.

AI-Helper 아이콘
AI-Helper
안녕하세요, AI-Helper입니다. 좌측 "선택된 텍스트"에서 텍스트를 선택하여 요약, 번역, 용어설명을 실행하세요.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.

선택된 텍스트

맨위로