2016
DOI: 10.5267/j.ijiec.2016.2.001
|View full text |Cite
|
Sign up to set email alerts
|

A hybrid metaheuristic method to optimize the order of the sequences in continuous-casting

Abstract: In this paper, we propose a hybrid metaheuristic algorithm to maximize the production and to minimize the processing time in the steel-making and continuous casting (SCC) by optimizing the order of the sequences where a sequence is a group of jobs with the same chemical characteristics. Based on the work Bellabdaoui and Teghem (2006) [Bellabdaoui, A., & Teghem, J. (2006). A mixed-integer linear programming model for the continuous casting planning. International Journal of Production Economics, 104(2), 260-270… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
4

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 34 publications
(33 reference statements)
0
3
0
Order By: Relevance
“…This makes that in a general way, a coordination figure is necessary, although sometimes the program itself identifies the sequence breakout as a restatement point of the scheduling. 37,41) 2.6.5. Use of Coordinator The use of algorithms that help to consolidate the programming of a steel plant invites to think about an automation of the process.…”
Section: Contingenciesmentioning
confidence: 99%
“…This makes that in a general way, a coordination figure is necessary, although sometimes the program itself identifies the sequence breakout as a restatement point of the scheduling. 37,41) 2.6.5. Use of Coordinator The use of algorithms that help to consolidate the programming of a steel plant invites to think about an automation of the process.…”
Section: Contingenciesmentioning
confidence: 99%
“…Based on the work of Bellabdaoui and Teghem (), Touil et al. () developed a SA algorithm restricted by a tabu list. Differently from our formulation, they have to schedule many fixed sequences of jobs, each one dedicated to a particular caster, with the objective of minimizing the total completion time.…”
Section: Related Workmentioning
confidence: 99%
“…Within the first group of mathematical programming methods, researchers proposed solutions ranging from the first SMCP [10], a multi-objective integer linear programming (MILP) model [11], a Lagrangian relaxation for machine capacity and job precedence constraints based on an approximate subgradient algorithm [12]. Constraint programming methods were reported in References [13][14][15], whereas metaheuristics and hybrid methods ranged from tabu search [16], evolutionary programming [17], artificial bee colony algorithms [18], simulated annealing [19,20], genetic algorithms [21] or particle swarm optimization (PSO) [22].…”
Section: Introductionmentioning
confidence: 99%