The double row layout problem (DRLP) occurs in automated manufacturing environments, where a material-handling device transports materials among machines arranged in a double-row layout, i.e. a layout in which the machines are located on either side of a straight line corridor. The DRLP is how to minimize the total cost of transporting materials between machines. The problem is NP-Hard and one great challenge nowadays is how to solve problem instances in reasonable computational times. In this paper, we give a new mixed-integer programming model of the DRLP, which is based on a linear extension of a partial order. In addition, we propose a reformulation of this model, which yields stronger results. The new models have the least number of 0–1 variables in comparison with previous models in the literature. Computational experiments demonstrate that the proposed models obtain optimal solutions faster than previously published ones.

双行布局问题（DRLP）发生在自动化制造环境中，在该环境中，物料搬运设备在以双行布局（即，机器位于直线走廊的两侧）布置的机器之间运输材料。DRLP是如何最大程度地减少机器之间运输物料的总成本。问题是NP-Hard，当今的一大挑战是如何在合理的计算时间内解决问题实例。在本文中，我们给出了一种新的DRLP混合整数编程模型，该模型基于部分顺序的线性扩展。另外，我们提出了对该模型的重新表述，它产生了更强的结果。与文献中的先前模型相比，新模型具有最少数量的0–1变量。