Multiple crane scheduling in a batch annealing process with no-delay constraints for machine unloading |
| |
Institution: | 1. Key Laboratory of Manufacturing Industrial and Integrated Automation, Shenyang University, Shenyang 110044, PR China;2. Liaoning Institute of Standardization, Shenyang 110004, PR China;3. Liaoning Key Laboratory of Manufacturing System and Logistics, The Logistics Institute, Northeastern University, Shenyang 110004, PR China |
| |
Abstract: | In this work, we focus on the scheduling of multi-crane operations in an iron and steel enterprise for a two-stage batch annealing process. The first stage is the heating process, and the second stage is the cooling process. To start the heating (cooling) stage, a special machine called a furnace (cooler) must be loaded. The real constraints of no-delay machine unloading are defined as follows: once the heating (cooling) is completed, the furnace (cooler) must be unloaded by crane immediately. The goal is to schedule limited machines (furnaces and coolers) operated by multiple cranes to minimize the completion time of the last annealed coil (makespan). We formulate a mixed-integer linear programming model to address this problem. Certain feasible properties are identified to avoid crane conflicts and ensure that the machine unloading no-delay constraints are met. Based on these necessary conditions, we then present a heuristic algorithm with running time in connection with the number of cranes, coils and machines. A lower bound to the problem is also developed. Through theoretical analysis, we show the worst-case bound of our heuristic algorithm. The average performances of the solution approaches are computationally evaluated. The computational results show that the proposed heuristic algorithm is capable of generating good quality solutions. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|