2014
DOI: 10.1080/00207543.2014.939238
|View full text |Cite
|
Sign up to set email alerts
|

A multi-objective scatter search for the ladle scheduling problem

Abstract: We consider the ladle scheduling problem, which can be regarded as a vehicle routing problem with semi-soft time windows and adjustment times. The problem concerns allocating ladles to serve molten steel based on a given steelmaking scheduling plan, and determining the modification operations for the empty ladles after the service process. In addition, combining the controllable processing time of molten steel, the other aspect of the problem is to determine the service start times taking into consideration th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
8
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(8 citation statements)
references
References 34 publications
(28 reference statements)
0
8
0
Order By: Relevance
“…In [24], the authors generalized the work from [18] and developed an efficient method based on the Simulated Annealing approach for its solution. In [7], [8], the authors studied a formulation based on the vehicle routing problem with soft time windows. They consider more detailed emptyladle operations, such as changing the sliding plate after some charges.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…In [24], the authors generalized the work from [18] and developed an efficient method based on the Simulated Annealing approach for its solution. In [7], [8], the authors studied a formulation based on the vehicle routing problem with soft time windows. They consider more detailed emptyladle operations, such as changing the sliding plate after some charges.…”
Section: Related Workmentioning
confidence: 99%
“…Considering the ladles for the SCC schedule calculation is essential for its applicability [6]. In [7], the authors formulate the ladle dispatching problem as a vehicle routing problem with soft time windows. [8] extends this formulation by adding extra constraints regarding ladle maintenance operations.…”
mentioning
confidence: 99%
“…(2) To avoid the production disorder due to the lack of ladles, the current solution of reserving a relatively large number of ladles not only causes huge startup energy consumption, but also consumes considerable energy consumption to keep the ladles at the prescribed temperature [1,3,11].…”
Section: Figure 1 Production Scheduling and Ladle Dispatching In Sccmentioning
confidence: 99%
“…Tan, et al selected a limited number of ladles from the available ones and scheduled them with the goal of minimizing the total gas consumption [12]. Based on this, Tan, et al further proposed a high-temperature-ladle matching rule to further reduce the total gas consumption [11]. Huang, et al considered the ladle scheduling as the key problems of temperature drop in the transportation of hot metal and investigated the influencing factors of steel ladles exchange during the steelmaking and continuous casting process [13].…”
Section: Figure 1 Production Scheduling and Ladle Dispatching In Sccmentioning
confidence: 99%
“…The main aim of task scheduler is decreasing the total cost, completion time and the computational complexity. 30,31 However, most of the existing research has focused on a single objective task scheduling in cloud systems. However, in real cases, more than one factor should be considered.…”
mentioning
confidence: 99%