메뉴 건너뛰기




Volumn 236, Issue 1, 2014, Pages 51-60

A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process

Author keywords

Hybrid flowshop; Scheduling; Steelmaking continuous casting; Subgradient optimization

Indexed keywords

HYBRID FLOW SHOP; HYBRID FLOW SHOP SCHEDULING; HYBRID FLOW-SHOP SCHEDULING (HFS); IRON AND STEEL PRODUCTIONS; LAGRANGIAN RELAXATIONS; MIXED-INTEGER PROGRAMMING; PRECEDENCE CONSTRAINTS; SUB-GRADIENT OPTIMIZATION;

EID: 84900576037     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2013.11.010     Document Type: Article
Times cited : (134)

References (33)
  • 1
    • 58549106334 scopus 로고    scopus 로고
    • A novel hybrid algorithm for scheduling steelmaking continuous casting production
    • A. Atighehchian, M. Bijari, and H. Tarkesh A novel hybrid algorithm for scheduling steelmaking continuous casting production Computers & Operations Research 36 2009 2450 2461
    • (2009) Computers & Operations Research , vol.36 , pp. 2450-2461
    • Atighehchian, A.1    Bijari, M.2    Tarkesh, H.3
  • 2
    • 33748751184 scopus 로고    scopus 로고
    • A mixed-integer linear programming model for the continuous casting planning
    • A. Bellabdaoui, and J. Teghem A mixed-integer linear programming model for the continuous casting planning International Journal of Production Economics 104 2006 260 270
    • (2006) International Journal of Production Economics , vol.104 , pp. 260-270
    • Bellabdaoui, A.1    Teghem, J.2
  • 5
    • 0029290912 scopus 로고
    • A descent proximal level bundle method for convex nondifferentiable optimization
    • U. Brannlund, K.C. Kiwiel, and P. Lindberg A descent proximal level bundle method for convex nondifferentiable optimization Operations Research Letters 17 1995 121 126
    • (1995) Operations Research Letters , vol.17 , pp. 121-126
    • Brannlund, U.1    Kiwiel, K.C.2    Lindberg, P.3
  • 6
    • 0032186585 scopus 로고    scopus 로고
    • An improvement of the lagrangian relaxation approach for job shop scheduling: A dynamic programming method
    • H. Chen, C. Chu, and J.M. Proth An improvement of the lagrangian relaxation approach for job shop scheduling: A dynamic programming method IEEE Transactions on Robotics and Automation 13 1998 786 795
    • (1998) IEEE Transactions on Robotics and Automation , vol.13 , pp. 786-795
    • Chen, H.1    Chu, C.2    Proth, J.M.3
  • 7
    • 0038238721 scopus 로고    scopus 로고
    • An alternative framework to lagrangian relaxation approach for job shop scheduling
    • H. Chen, and P.B. Luh An alternative framework to lagrangian relaxation approach for job shop scheduling European Journal of Operational Research 149 2003 499 512
    • (2003) European Journal of Operational Research , vol.149 , pp. 499-512
    • Chen, H.1    Luh, P.B.2
  • 8
    • 79960194614 scopus 로고    scopus 로고
    • A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-waited constraints
    • C. Gicquel, L. Hege, M. Minoux, and W. van Canneyt A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-waited constraints Computers & Operations Research 39 2012 629 636
    • (2012) Computers & Operations Research , vol.39 , pp. 629-636
    • Gicquel, C.1    Hege, L.2    Minoux, M.3    Van Canneyt, W.4
  • 9
    • 0000908433 scopus 로고    scopus 로고
    • Convergence of a simple subgradient level method
    • J.L. Goffin, and K.C. Kiwiel Convergence of a simple subgradient level method Mathematical Programming 85 1999 207 211
    • (1999) Mathematical Programming , vol.85 , pp. 207-211
    • Goffin, J.L.1    Kiwiel, K.C.2
  • 15
    • 0036462808 scopus 로고    scopus 로고
    • Survey of bundle methods for nonsmooth optimization
    • M.M. Markela Survey of bundle methods for nonsmooth optimization Optimization Methods and Software 17 2002 1 29
    • (2002) Optimization Methods and Software , vol.17 , pp. 1-29
    • Markela, M.M.1
  • 16
    • 70449590249 scopus 로고    scopus 로고
    • A scheduling system for the steelmaking-continuous casting process: A case study from the steel-making industry
    • H. Missbauer, W. Hauberb, and W. Stadler A scheduling system for the steelmaking-continuous casting process: A case study from the steel-making industry International Journal of Production Research 47 2009 4147 4172
    • (2009) International Journal of Production Research , vol.47 , pp. 4147-4172
    • Missbauer, H.1    Hauberb, W.2    Stadler, W.3
  • 17
    • 0036342213 scopus 로고    scopus 로고
    • Incremental subgradient methods for nondifferentiable optimization
    • A. Nedic, and D.P. Bertsekas Incremental subgradient methods for nondifferentiable optimization SIAM Journal of Optimization 12 2001 109 138
    • (2001) SIAM Journal of Optimization , vol.12 , pp. 109-138
    • Nedic, A.1    Bertsekas, D.P.2
  • 18
    • 68249096943 scopus 로고    scopus 로고
    • Lagrangian relaxation with cut generation for hybrid flow shop scheduling problems to minimize the total weighted tardiness
    • T. Nishi, Y. Hiranaka, and M. Inuiguchi Lagrangian relaxation with cut generation for hybrid flow shop scheduling problems to minimize the total weighted tardiness Computers & Operations Research 37 2010 189 198
    • (2010) Computers & Operations Research , vol.37 , pp. 189-198
    • Nishi, T.1    Hiranaka, Y.2    Inuiguchi, M.3
  • 19
    • 0038183858 scopus 로고    scopus 로고
    • Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop
    • C. Oguz, M.F. Ercan, T.C.E. Cheng, and Y.F. Fung Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop European Journal of Operations Research 149 2003 390 403
    • (2003) European Journal of Operations Research , vol.149 , pp. 390-403
    • Oguz, C.1    Ercan, M.F.2    Cheng, T.C.E.3    Fung, Y.F.4
  • 20
    • 9644281095 scopus 로고    scopus 로고
    • Prodution scheduling in a steelmaking-continuous casting plant
    • D. Pacciarelli, and M. Pranzo Prodution scheduling in a steelmaking-continuous casting plant Computers & Chemical Engineering 28 2004 2823 2835
    • (2004) Computers & Chemical Engineering , vol.28 , pp. 2823-2835
    • Pacciarelli, D.1    Pranzo, M.2
  • 22
    • 0000686629 scopus 로고
    • A general method of solving extremum problems
    • B. Polyak A general method of solving extremum problems Soviet Mathematics Doklady 8 1967 593 597
    • (1967) Soviet Mathematics Doklady , vol.8 , pp. 593-597
    • Polyak, B.1
  • 23
    • 73449099561 scopus 로고    scopus 로고
    • Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
    • I. Ribas, R. Leisten, and J. Framinan Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective Computers & Operations Research 37 2010 1439 1454
    • (2010) Computers & Operations Research , vol.37 , pp. 1439-1454
    • Ribas, I.1    Leisten, R.2    Framinan, J.3
  • 24
    • 27144540137 scopus 로고    scopus 로고
    • A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
    • R. Ruiz, and C. Maroto A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility European Journal of Operations Research 169 2006 781 800
    • (2006) European Journal of Operations Research , vol.169 , pp. 781-800
    • Ruiz, R.1    Maroto, C.2
  • 27
    • 0035899628 scopus 로고    scopus 로고
    • A review of planning and scheduling systems and methods for integrated steel production
    • L. Tang, J. Liu, A. Rong, and Z. Yang A review of planning and scheduling systems and methods for integrated steel production European Journal of Operations Research 133 2001 1 20
    • (2001) European Journal of Operations Research , vol.133 , pp. 1-20
    • Tang, L.1    Liu, J.2    Rong, A.3    Yang, Z.4
  • 29
    • 33644684986 scopus 로고    scopus 로고
    • A new lagrangian relaxation algorithm for hybrid flow shop scheduling to minimize total weighted completion time
    • L. Tang, H. Xuan, and J. Liu A new lagrangian relaxation algorithm for hybrid flow shop scheduling to minimize total weighted completion time Computers & Operations Research 33 2006 3344 3359
    • (2006) Computers & Operations Research , vol.33 , pp. 3344-3359
    • Tang, L.1    Xuan, H.2    Liu, J.3
  • 30
    • 33846569020 scopus 로고    scopus 로고
    • Hybrid backward and forward dynamic programming based lagrangian relaxation for single machine scheduling
    • L. Tang, H. Xuan, and J. Liu Hybrid backward and forward dynamic programming based lagrangian relaxation for single machine scheduling Computers & Operations Research 34 2007 2625 2636
    • (2007) Computers & Operations Research , vol.34 , pp. 2625-2636
    • Tang, L.1    Xuan, H.2    Liu, J.3
  • 31
    • 0036332649 scopus 로고    scopus 로고
    • An improved stepsize of the subgradient algorithm for solving the Lagrangian relaxation problem
    • S.H. Wang An improved stepsize of the subgradient algorithm for solving the Lagrangian relaxation problem Computers & Electrical Engineering 29 2003 245 249
    • (2003) Computers & Electrical Engineering , vol.29 , pp. 245-249
    • Wang, S.H.1
  • 32
    • 33846601882 scopus 로고    scopus 로고
    • Scheduling a hybrid flow shop with batch production at the last stage
    • H. Xuan, and L. Tang Scheduling a hybrid flow shop with batch production at the last stage Computers & Operations Research 34 2007 2178 2733
    • (2007) Computers & Operations Research , vol.34 , pp. 2178-2733
    • Xuan, H.1    Tang, L.2


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