Scheduling of BOF Producing Molten Steel for CSP and PM

This paper established a scheduling model using disjunctive graph and it was implemented in B works, where two casting machines were sharing the molten steel of two converters. The graph represented and satisfied constraints of buffer capacity and maximum residence time from hot metal´s refining to casting. By means of heuristic algorithm based on maximum consecutive heats without outsourcing and minimum consecutive heats between two adjacent acceptance of outsourcing, the paper also demonstrated that exchanging sub-sequence of task at proper switching point could attain optimized schedule.