Allocation problems with sequencing side constraints (APSSC) arise as a kernel optimization problem in production planning and operations scheduling in the steel industry. For example, continuous casting of slabs requires that the designed slabs are allocated to cast templates based on grade and associated capacity. However, the group of slabs allocated to a cast also need to be sequenced based on width transition constraints.
The focus of this report is twofold. The first is to visit the literature to study and benchmark some of the current algorithms that have been developed for asymmetric sequencing problems. The second is to study the hot strip mill scheduling problem in the steel industry and develop algorithms that are composed based on some of these kernel optimization functions for asymmetric sequencing.
By: Richa Agarwal; Jayant Kalagnanam; Chandra Reddy
Published in: RC23384 in 2004
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .