Steel Coils Scheduling in a Flow-Shop with Parallel Tools and Tight Constraints

Portmann, Marie-Claude; Camps, J.-J.

doi:10.1016/b978-0-444-89856-2.50047-8

Cited by 1 publication

(2 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A hierarchical approach for solving production manufacturing problems has been used by many authors (see for example : Axsater, 1981;Yasuda et al, 1984;Portmann and Camps, 1993). In particular the complexity of exact algorithms makes a global approach impractical.…”

Section: Introductionmentioning

confidence: 99%

“…In particular the complexity of exact algorithms makes a global approach impractical. Many approaches have been developed for iron and steel factories: some of them used operations research tools, other used artificial intelligence techniques (see for example: Nakagawa et al, 1980;Vasko and Friedel, 1982;Yasuda et al, 1984;Wright and Houck, 1985;Jacobs et al, 1988;Nambiar and Acharya, 1988;Guay, 1990;Lu et al, 1990;Manheim et al, 1990;Shah et al, 1990;Tabucanon and Sasiwong, 1991;Thorsen and Vidal, 1991;Portmann and Camps, 1993). Unfortunately developments made for one company are not usable by another.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Hierarchical production management applied to an iron and steel industry

Portmann

Rohr

1995

J Intell Manuf

View full text Add to dashboard Cite

A scheduling problem arising in the iron and steel industry is discussed. It concerns the medium planning and the short-term scheduling of three tools: continuous-casting, strip mill and finishing, these three belonging to the hot unit of an iron and steel company. The strip mill is more constrained than the other two, it is therefore called the pivot, the continuous-casting tool is called the upstream tool and the finishing tool is called the downstream tool. A hierarchical approach consisting of two levels is designed. At each level of this hierarchy, the pivot is scheduled first followed by the other tools under the constraints of the pivot schedule. Methods are proposed to solve scheduling problems arising from this approach. Each of the methods is an approximation scheme because of the NP-hardness of the scheduling problems. Some of the approximation schemes are local search methods (simulated annealing improved by some specific techniques), others are specific constructive methods built to solve given problems. An interesting criterion is the following: the schedule of the pivot being given, the schedule of the upstream tool must begin as late as possible and the schedule of the downstream must end as soon as possible in order to minimize the inventory cost between the tools while minimizing the other costs of manufacturing such as the number of profile changes, the number of block changes, etc. The pivot medium-term solving is the most developed part of this paper and it is tested on some generated examples; the generator description and the numerical results are presented.

show abstract

Section: Introductionmentioning

confidence: 99%