Hot-Rolling Batch Planning Problem of Round Bar with Roller Capacity

Liang Bai; Tie Ke Li; Bai Lin Wang; Guang Jing Dong; Shao Yun Xu

doi:10.4028/www.scientific.net/AMR.941-944.2317

Paper Titles

Numerical Simulation and Process Analysis for Injection Forming about the Thin-Wall Conical Centrifugal Disc
p.2298

Numerical Simulation of Liner Curvature Radius on Formation of LEFP
p.2305

Study on Transverse Uniformity of Phase Transformation for Hot-Rolled Strip on Run-out-Table
p.2309

Finite Element Modelling of Copper by Equal Channel Angular Extrusion
p.2313

Hot-Rolling Batch Planning Problem of Round Bar with Roller Capacity
p.2317

Modeling and Virtual Simulation of Hard Surface Milling and Forming Process Using Advanced CAE Systems
p.2321

The Inverse Prediction for Profile Extrusion Die Based on the Finite Element Method
p.2332

A Numerical Approach for Simulating a Self-Contacted Elastic Rod
p.2336

A Schwarz Alternating Algorithm Using Elliptical Arc Artificial Boundary for Exterior Problems with a Concave Angle
p.2341

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 941-944Hot-Rolling Batch Planning Problem of Round Bar...

Hot-Rolling Batch Planning Problem of Round Bar with Roller Capacity

Abstract:

Considering the feature of roller capacity with dynamics change in round bar production, a hot-rolling batch planning problem is studied. Firstly, the problem is formulated as a different capacities vehicle routing problem (DCVRP). And then, a mathematic model is built with two optimization objectives, minimization for total set-up time and maximization for utilization of roller. Secondly, an algorithm based on constraint satisfaction technique is present with variable selection rules and value selection rules for billet selecting, grouping and sequencing, and constraint propagation for searching-space reducing and rolling-unit partitioning. Meanwhile, the current capacity of online roller is updated dynamically during the solving process of algorithm. Finally, comparing results indicated that the proposed model and algorithm are effective and efficient.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 941-944)

Pages:

2317-2320

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.941-944.2317

Citation:

Cite this paper

Online since:

June 2014

Authors:

Liang Bai*, Tie Ke Li, Bai Lin Wang, Guang Jing Dong, Shao Yun Xu

Keywords:

Batch Planning, Constraint Satisfaction, Roller Capacity, Round Bar

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Lopez L, Carter M W, Gendreau M. The hot strip mill production scheduling problem: A tabu search approach. European Journal of Operational Research, Vol. 106 (1998), pp.317-330.

DOI: 10.1016/s0377-2217(97)00277-4

Google Scholar

[2] Tang L X, Liu J Y, Rong A Y, et al. A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron & Steel Complex. European Journal of Operational Research, Vol. 124 (2000), pp.270-280.

DOI: 10.1016/s0377-2217(99)00380-x

Google Scholar

[3] Li T K, Guo D F. Model and algorithm for hot-rolling batch plan based on constraint satisfaction. Control and Decision, Vol. 22 (2007), pp.389-393. (In Chinese).

Google Scholar

[4] Jia S J, Yi J, Yang G K, et al. A multi-objective optimisation algorithm for the hot rolling batch scheduling problem. International Journal of Production Research, Vol. 51 (2013), pp.667-681.

DOI: 10.1080/00207543.2011.654138

Google Scholar