Name
Abstract | ||
|---|---|---|
In this paper a new scheduling problem is presented, which originates from the steel processing industry. The optimal scheduling of a steel forge is investigated with the goal of minimizing setup and storage costs under strict deadlines and special resource constraints. The main distinctive feature of the problem is the deterioration of some equipment, in this case, the so-called forging dies. While the aging effect has been widely investigated in scheduling approaches, where production speed decreases through time, durability deterioration caused by equipment setup has not been addressed yet. In this paper a mixed-integer linear programming model is proposed for solving the problem. The model uses a uniform discrete time representation and resource-balance constraints based on the resource–task network model formulation method. The proposed method was tested on 3-week long schedules based on real industrial scenarios. Computational results show that the approach is able to provide optimal short-term schedules in reasonable time. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1007/s10479-019-03336-6 | Annals of Operations Research |
Keywords | Field | DocType |
Scheduling, Forge, Due dates, Deterioration, MILP | Mathematical optimization,Job shop scheduling,Durability,Scheduling (computing),Schedule,Forging,Linear programming,Discrete time and continuous time,Network model,Mathematics | Journal |
Volume | Issue | ISSN |
285 | 1 | 0254-5330 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Olivér Ősz | 1 | 0 | 0.34 |
| Balázs Ferenczi | 2 | 0 | 0.34 |
| Máté Hegyháti | 3 | 2 | 0.76 |