2017
DOI: 10.1016/j.compchemeng.2017.05.026
|View full text |Cite
|
Sign up to set email alerts
|

An improved Lagrangian relaxation approach to scheduling steelmaking-continuous casting process

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 43 publications
(11 citation statements)
references
References 50 publications
0
11
0
Order By: Relevance
“…Generate N h countries by the heuristic presented in section ''Empire initialization,'' and generate N-N h countries randomly. Select N Imp best countries as imperialists to construct the empires, and allocate randomly the remaining N-N Imp countries to the N Imp imperialists as colonies according to Formula (1). If an imperialist (Say I i ) has not been allocated any colony, select an imperialist randomly (Say I j ) and allocate I i to I j as a colony.…”
Section: Comparison Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…Generate N h countries by the heuristic presented in section ''Empire initialization,'' and generate N-N h countries randomly. Select N Imp best countries as imperialists to construct the empires, and allocate randomly the remaining N-N Imp countries to the N Imp imperialists as colonies according to Formula (1). If an imperialist (Say I i ) has not been allocated any colony, select an imperialist randomly (Say I j ) and allocate I i to I j as a colony.…”
Section: Comparison Resultsmentioning
confidence: 99%
“…end while N Imp empires. The number of colonies allocated to the j th empire (say NC j ) is determined by Formula (1).…”
Section: Empire Initializationmentioning
confidence: 99%
See 1 more Smart Citation
“…The main focus of this paper is to deal with the problem of scheduling in the steel industry related to primary production. Cui and Luo 11 developed a mixed integer nonlinear mathematical model and applied the Lagrangian relaxation (LR) approach to solve the SMCC problem. Lin et al 12 developed a novel search algorithm and a new Pareto optimization approach for solving problems with four conflicting objectives.…”
Section: Literature Reviewmentioning
confidence: 99%
“…The problem was formulated as an NLP and solved by sequential quadratic programming. Cui and Luo investigated the scheduling of continuous casting facilities by means of a mixed‐integer nonlinear programming (MINLP) formulation. Instead of using sequential quadratic programming, a tailor‐made Lagrangian relaxation was developed to cope with problems in computation time.…”
Section: Unit Operation Optimizationmentioning
confidence: 99%