메뉴 건너뛰기




Volumn 63, Issue 2, 2012, Pages 168-182

A hybrid shifting bottleneck procedure algorithm for the parallel-machine job-shop scheduling problem

Author keywords

heuristics; job shop; metaheuristics; parallel machine; scheduling; shifting bottleneck procedure

Indexed keywords

MACHINERY; SCHEDULING; SCHEDULING ALGORITHMS; TABU SEARCH;

EID: 84862908638     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.2011.4     Document Type: Article
Times cited : (38)

References (23)
  • 1
    • 0023977010 scopus 로고
    • The shifting bottleneck procedure for job shop scheduling
    • Adams J, Balas E and Zawack D (1988). The shifting bottleneck procedure for job shop scheduling. Manage Sci 34(3): 391-401.
    • (1988) Manage Sci , vol.34 , Issue.3 , pp. 391-401
    • Adams, J.1    Balas, E.2    Zawack, D.3
  • 3
    • 0031997369 scopus 로고    scopus 로고
    • Guided local search with shifting bottleneck for job shop scheduling
    • Balas W and Vazacopoulos A (1998). Guided local search with shifting bottleneck for job shop scheduling. Manage Sci 44: 262-275. (Pubitemid 128596865)
    • (1998) Management Science , vol.44 , Issue.2 , pp. 262-275
    • Balas, E.1    Vazacopoulos, A.2
  • 4
    • 0020178733 scopus 로고
    • The one-machine sequencing problem
    • Carlier J (1982). The one-machine sequencing problem. Eu J Opnl Res 11: 42-47.
    • (1982) Eu J Opnl Res , vol.11 , pp. 42-47
    • Carlier, J.1
  • 5
    • 0038238721 scopus 로고    scopus 로고
    • An alternative framework to Lagrangian relaxation approach for job shop scheduling
    • Chen H and Luh PB (2003). An alternative framework to Lagrangian relaxation approach for job shop scheduling. Eur J Opnl Res 149: 499-512.
    • (2003) Eur J Opnl Res , vol.149 , pp. 499-512
    • Chen, H.1    Luh, P.B.2
  • 6
    • 0346485830 scopus 로고    scopus 로고
    • A shifting bottleneck approach for a parallel-machine flowshop scheduling problem
    • Cheng J, Karuno Y and Kise H (2001). A shifting bottleneck approach for a parallel-machine flowshop scheduling problem. J Opns Res Soc Jpn 44(2): 140-155.
    • (2001) J Opns Res Soc Jpn , vol.44 , Issue.2 , pp. 140-155
    • Cheng, J.1    Karuno, Y.2    Kise, H.3
  • 7
    • 0042261208 scopus 로고    scopus 로고
    • An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
    • Dauzère-Pérès S and Paulli J (1997). An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search. Ann Opns Res 70: 281-306.
    • (1997) Ann Opns Res , vol.70 , pp. 281-306
    • Dauzère-Pérès, S.1    Paulli, J.2
  • 8
    • 34547651088 scopus 로고    scopus 로고
    • Mathematical modeling and heuristic approaches to flexible job shop scheduling problems
    • DOI 10.1007/s10845-007-0026-8
    • Fattahi P, Mehrabad MS and Jolai F (2007). Mathematical modeling and heuristic approaches to flexible job shop scheduling problems. J Intell Manuf 18: 331-342. (Pubitemid 47209689)
    • (2007) Journal of Intelligent Manufacturing , vol.18 , Issue.3 , pp. 331-342
    • Fattahi, P.1    Saidi Mehrabad, M.2    Jolai, F.3
  • 9
    • 38749142590 scopus 로고    scopus 로고
    • A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
    • DOI 10.1016/j.cor.2007.01.001, PII S0305054807000020
    • Gao J, Sun L and Gen M (2008). A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Comput Opns Res 35: 2892-2907. (Pubitemid 351186807)
    • (2008) Computers and Operations Research , vol.35 , Issue.9 , pp. 2892-2907
    • Gao, J.1    Sun, L.2    Gen, M.3
  • 10
    • 2642529311 scopus 로고    scopus 로고
    • An improved shifting bottleneck procedure for the job shop scheduling problem
    • Huang WQ and Yin AH (2004). An improved shifting bottleneck procedure for the job shop scheduling problem. Comput Opns Res 31: 2093-2110.
    • (2004) Comput Opns Res , vol.31 , pp. 2093-2110
    • Huang, W.Q.1    Yin, A.H.2
  • 11
    • 0030121742 scopus 로고    scopus 로고
    • Extending the shifting bottleneck procedure to real-life applications
    • Ivens P and Lambrecht M (1996). Extending the shifting bottleneck procedure to real-life applications. Eur J Opnl Res 90: 252-268. (Pubitemid 126652213)
    • (1996) European Journal of Operational Research , vol.90 , Issue.2 , pp. 252-268
    • Ivens, P.1    Lambrecht, M.2
  • 13
    • 62549158188 scopus 로고    scopus 로고
    • Scheduling trains as a blocking parallel-machine job shop scheduling problem
    • Liu SQ and Kozan E (2009). Scheduling trains as a blocking parallel-machine job shop scheduling problem. Comput Opns Res 36: 2840-2852.
    • (2009) Comput Opns Res , vol.36 , pp. 2840-2852
    • Liu, S.Q.1    Kozan, E.2
  • 14
    • 79957454187 scopus 로고    scopus 로고
    • Scheduling trains with priorities: A no-wait blocking parallel-machine job-shop scheduling model
    • Liu SQ and Kozan E (2011). Scheduling trains with priorities: A no-wait blocking parallel-machine job-shop scheduling model. Transport Sci 45: 175-198.
    • (2011) Transport Sci , vol.45 , pp. 175-198
    • Liu, S.Q.1    Kozan, E.2
  • 15
    • 4444276809 scopus 로고    scopus 로고
    • Metaheuristics for the mixed shop scheduling problem
    • Liu SQ and Ong HL (2004). Metaheuristics for the mixed shop scheduling problem. Asia Pac J Opnl Res 21(4): 97-115.
    • (2004) Asia Pac J Opnl Res , vol.21 , Issue.4 , pp. 97-115
    • Liu, S.Q.1    Ong, H.L.2
  • 16
    • 18844386279 scopus 로고    scopus 로고
    • A fast tabu search algorithm for the group shop scheduling problem
    • DOI 10.1016/j.advengsoft.2005.02.002, PII S0965997805000189
    • Liu SQ, Ong HL and Ng KM (2005). A fast tabu search algorithm for the group shop scheduling problem. Adv Eng Softw 36: 533-539. (Pubitemid 40682491)
    • (2005) Advances in Engineering Software , vol.36 , Issue.8 , pp. 533-539
    • Liu, S.Q.1    Ong, H.L.2    Ng, K.M.3
  • 17
    • 0042622980 scopus 로고    scopus 로고
    • A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
    • Mason SJ, Fowler JW and Carlyle WM (2002). A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops. J Sched 5(3): 247-262.
    • (2002) J Sched , vol.5 , Issue.3 , pp. 247-262
    • Mason, S.J.1    Fowler, J.W.2    Carlyle, W.M.3
  • 18
    • 26444453872 scopus 로고    scopus 로고
    • A distributed shifting bottleneck heuristic for complex job shops
    • DOI 10.1016/j.cie.2005.06.004, PII S0360835205000793
    • Mönch L and Drießel R (2005). A distributed shifting bottleneck heuristic for complex job shops. Comput Ind Eng 49: 363-380. (Pubitemid 41436335)
    • (2005) Computers and Industrial Engineering , vol.49 , Issue.3 , pp. 363-380
    • Monch, L.1    Driessel, R.2
  • 19
    • 33750718514 scopus 로고    scopus 로고
    • Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops
    • DOI 10.1016/j.ejor.2005.12.020, PII S0377221705008532
    • Mönch L, Schabacker R, Pabst D and Fowler JW (2007). Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops. Eur J Opnl Res 177: 2100-2118. (Pubitemid 44709466)
    • (2007) European Journal of Operational Research , vol.177 , Issue.3 , pp. 2100-2118
    • Monch, L.1    Schabacker, R.2    Pabst, D.3    Fowler, J.W.4
  • 20
    • 38349091116 scopus 로고    scopus 로고
    • A multi-criteria approach for scheduling semiconductor wafer fabrication facilities
    • Pfund ME, Balasubramanian H, Fowler JW, Mason SJ and Rose O (2008). A multi-criteria approach for scheduling semiconductor wafer fabrication facilities. J Sched 11(1): 29-47.
    • (2008) J Sched , vol.11 , Issue.1 , pp. 29-47
    • Pfund, M.E.1    Balasubramanian, H.2    Fowler, J.W.3    Mason, S.J.4    Rose, O.5
  • 21
    • 0030216103 scopus 로고    scopus 로고
    • The generalized Shifting Bottleneck Procedure
    • DOI 10.1016/0377-2217(95)00135-2
    • Ramudhin A and Marier P (1996). The generalized shifting bottleneck procedure. Eur J Opnl Res 93: 34-48. (Pubitemid 126389265)
    • (1996) European Journal of Operational Research , vol.93 , Issue.1 , pp. 34-48
    • Ramudhin, A.1    Marier, P.2
  • 22
    • 0029332976 scopus 로고
    • Backtracking techniques for the job shop scheduling constraint satisfaction problem
    • Sadeh N, Sycara K and Xiong Y (1995). Backtracking techniques for the job shop scheduling constraint satisfaction problem. Artif Intell 76: 455-480.
    • (1995) Artif Intell , vol.76 , pp. 455-480
    • Sadeh, N.1    Sycara, K.2    Xiong, Y.3
  • 23
    • 14044268702 scopus 로고    scopus 로고
    • An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems
    • DOI 10.1016/j.cie.2005.01.018, PII S0360835205000197
    • Xia W and Wu Z (2005). An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Comput Ind Eng 48: 409-425. (Pubitemid 40274933)
    • (2005) Computers and Industrial Engineering , vol.48 , Issue.2 , pp. 409-425
    • Xia, W.1    Wu, Z.2


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