An online algorithm for continuous slab caster scheduling |
| |
Authors: | Young-Soo Myung |
| |
Affiliation: | 1. Department of Business Administration , Dankook University , Cheonan, Chungnam 330714, Korea myung@dankook.ac.kr |
| |
Abstract: | Lee et al. (Lee, K., Chang, S.Y., and Hong, Y., 2004. Continuous slab caster scheduling and interval graphs. Production Planning & Control, 13 (5), 495–501) have introduced a slab caster scheduling problem and developed an optimal algorithm. Their algorithm is efficient but an offline algorithm that we need the information on all the customer orders a priori to implement. In this article, we propose an online algorithm that we can implement without knowledge of the orders yet to arrive. We show that the offline version of our new algorithm also provides an optimal solution and the online version has the worst case performance ratio of 3. We also give a short proof on the correctness of Lee et al.'s algorithm. |
| |
Keywords: | continuous caster scheduling clique partitioning interval graph online algorithm |
|
|