철강공정의 일정계획을 위한 혼합 정수 계획 모델Mixed-Integer programming model for scheduling of steelmaking processes

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 384
  • Download : 0
This paper presents a short-term scheduling algorithm for the operation of steelmaking processes. The scope of the problem covers refining of the hot iron transferred form a blast furnace, ladle treatment, continuous casting, hot-rolling, and coiling for the final products that should satisfy the given demand. The processing time at each unit depends on how much the batch amount is treated, and te dedicated intermediate storage with finite capacity between the units is considered. Resource constraints and initial amount of each state are incorporated into the presented scheduling model for the algorithm of on-line scheduling. We propose amixed integer linear programming (MILP) model with two objectives for the scheduling. The first is to maximize the total profit while atisfying the due date constraint for each product. And the second is to minimize the total processing time, makespan, while satisfying the demand for each product. Especially, we observe the effect of penalizing the intermediate storage and the inventory level of the final product on the scheduling results.
Publisher
제어·로봇·시스템학회
Issue Date
1999-08
Language
Korean
Citation

제어.자동화.시스템공학 논문지, v.5, no.6, pp.714 - 723

ISSN
1225-9853
URI
http://hdl.handle.net/10203/77130
Appears in Collection
CBE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0