Production Scheduling Optimization Algorithm for the Steel-Making Continuous Casting Processes | ||
| Advances in Industrial Engineering | ||
| دوره 53، شماره 4، زمستان 2019، صفحه 127-147 اصل مقاله (592.98 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22059/jieng.2021.306226.1732 | ||
| نویسنده | ||
| Mahdi Nakhaeinejad* | ||
| Department of Industrial Engineering, Yazd University, Yazd, Iran | ||
| چکیده | ||
| This paper investigates steel-making continuous casting (SCC) scheduling problem. SCC is a high temperature and large-scale logistics machining process with batch production at the last stage that was identified as the key process of modern iron and steel enterprises. This paper presents a mathematical model for scheduling SCC process. The model is developed as a Mixed Zero- One Linear programming (MZOLP) based on actual production situations of SCC. The objective is to schedule a set of charges (jobs) to minimize the earliness and tardiness penalty costs as well as the charge waiting time cost. The solution methodology is developed based on a branch-and-bound algorithm. A heuristic method is presented at the beginning of the search in order to compute an initial upper bound. A lower bound and an upper bound are developed and a method for reducing branches is established based on the batch production in the continuous casting (CC) stage. Moreover, branching schemes are proposed. The branch- and- bound algorithm incorporating the initial upper bound, the lower and upper bound, the method for reducing branches, and branching schemes is tested on a set of instances. The analysis shows the efficiency of the proposed features for the algorithm. | ||
| کلیدواژهها | ||
| Steel making؛ Continuous Casting؛ Production Scheduling؛ Branch and Bound Algorithm | ||
| مراجع | ||
|
| ||
|
آمار تعداد مشاهده مقاله: 989 تعداد دریافت فایل اصل مقاله: 1,442 |
||