Abstract

This paper investigates a new kind of single machine scheduling problem derived from the production scheduling of reheating furnaces in the iron and steel industry. In this problem, the single machine can simultaneously process multiple jobs. However, there is no batch and the jobs enter and leave the machine one by one and continuously. The objective is to minimize the total weighted tardiness of all jobs. We formulate this problem as a mixed integer linear programming (MILP) model and propose a simplified scatter search algorithm. The computational results on randomly generated instances show that the MILP model is correct and the proposed SSS algorithm outperforms CPLEX.

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 call

Disclaimer: 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.