Continuous slab caster scheduling and interval graphs

Abstract

We define and solve a scheduling problem for operating the continuous steel slab caster which converts molten steel into slabs. The nature of our problem has an interesting connection to a special class of graphs known as interval graphs. We show that our problem can be seen as a variant of the clique partitioning problem defined on interval graphs and develop an optimal algorithm for it.