On the integer programming formulation of production scheduling optimisation algorithm for the hot rolling processes

被引:11
作者
Alidaee, Bahram [1 ]
Wang, Haibo [2 ]
机构
[1] Univ Mississippi, Sch Business Adm, University, MS 38677 USA
[2] Texas A&M Int Univ, Sanchez Sch Business, Laredo, TX USA
关键词
hot rolling production scheduling; vehicle routing problem; SALESMAN PROBLEMS;
D O I
10.1080/00207543.2011.642321
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This note is concerned with the formulation of scheduling of the hot rolling process (SHRP). Based on the capacitated vehicle routing problem (CVRP), Chen et al. (Chen, A.L., Yang, G.K., and Wu, Z.M., 2008. Production scheduling optimization algorithm for the hot rolling processes. International Journal of Production Research, 46 (7), 1955-1973) proposed a nonlinear integer programming formulation of SHRP. Due to some deficiencies in the formulation, Kim (Kim, B.-I., 2010. Some comments on Chen et al. 'Production scheduling optimization algorithm for the hot rolling processes'. International Journal of Production Research, 48 (7), 2165-2167) very recently gave some correction to the model. However, even with the correction the model has flaws. The purpose of this note is to give a complete, also based on CVRP, corrected formulation with substantial number of variables reduced.
引用
收藏
页码:6036 / 6039
页数:4
相关论文
共 6 条
[1]   Production scheduling optimization algorithm for the hot rolling processes [J].
Chen, A. L. ;
Yang, G. K. ;
Wu, Z. M. .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2008, 46 (07) :1955-1973
[2]   A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem [J].
Kara, I ;
Laporte, G ;
Bektas, T .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 158 (03) :793-795
[3]   Integer linear programming formulations of multiple salesman problems and its variations [J].
Kara, Imdat ;
Bektas, Tolga .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 174 (03) :1449-1458
[4]   Some comments on Chen et al. 'Production scheduling optimization algorithm for the hot rolling processes' [J].
Kim, Byung-In .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2010, 48 (07) :2165-2167
[5]   INTEGER PROGRAMMING FORMULATION OF TRAVELING SALESMAN PROBLEMS [J].
MILLER, CE ;
TUCKER, AW ;
ZEMLIN, RA .
JOURNAL OF THE ACM, 1960, 7 (04) :326-329
[6]   A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron & Steel Complex [J].
Tang, LX ;
Liu, JY ;
Rong, AY ;
Yang, ZH .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 124 (02) :267-282