.png){kind=icon}
.png){kind=icon}
Return
On the integer programming formulation of production scheduling optimisation algorithm for the hot rolling processes
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2011.642321.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
hot rolling production scheduling
vehicle routing problem
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.3
Papers:
1.1W
Citations:
3.7W