Abstract
In this paper, an iron and steel production scheduling problem is studied. An algorithm based on an implicit enumeration procedure is developed to solve the problem. Due to the large number of practical constraints, the real-world scheduling problem can be e fficiently solved by the enumeration based algorithm within acceptable computation time. The method is applied to generate steel production schedules for a steel production company in Canada. The computer generated schedules are compared with the manually generated and currently used schedules in the company. Computational results show large potential savings from the optimal schedules over the manually generated schedules.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
