文献类型：期刊文献

英文题名：A hybrid flowshop scheduling problem for a cold treating process in seamless steel tube production

作者：Li, Lin[1,2];Huo, Jiazhen[1];Tang, Ou[1,3]

机构：[1]Tongji Univ, Sch Econ & Management, Shanghai 200092, Peoples R China;[2]E China Univ Sci & Technol, Sch Business, Shanghai 200237, Peoples R China;[3]Linkoping Univ, Dept Management & Engn, SE-58183 Linkoping, Sweden

年份：2011

卷号：49

期号：15

起止页码：4679

外文期刊名：INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH

收录：;EI(收录号：20112514077865);WOS:【SCI-EXPANDED(收录号:WOS:000291591300013)】；

基金：This work was supported by the National Natural Science Foundation of China under grant numbers 70772077 and 70832005.

语种：英文

外文关键词：hybrid flowshop scheduling; mixed integer programming; genetic algorithm; seamless steel tube production

摘要：Seamless steel tubes often have various categories and specifications, which further require complicated operations in production, especially in the cold treating process (CTP). This paper investigates the scheduling problem using the seamless tube plant of Baoshan Iron and Steel Complex as a study background. By considering the practical production constraints such as sequence-dependent setup times, maintenance schedule, intermediate material buffers, job-machine matches, we formulate the hybrid flowshop scheduling problem with a non-linear mixed integer programming model (NMIP). In addition, our model provides a flexibility to remove the permutation assumption, which is often a limitation in early studies. In order to obtain the solution of the above NMIP problem, a two-stage heuristic algorithm is proposed and it combines a modified genetic algorithm and a local search method. With real production instances, our computation experiments indicate that the proposed algorithm is efficient and it outperforms several other approaches. Industrial implementation also shows that such a scheduling tool brings a cost saving of more than 10% and it substantially reduces the computation time. Our study also illustrates the need of relaxing permutation assumption in such a scheduling problem with complicated operation sequences.