Abstract
This article studies the parallel row ordering problem (PROP), which is NP-hard. The PROP is interesting from both a theoretical and practical point of view. A new mixed-integer programming model for this problem is proposed, which presents a superior performance to that of a former mixed-integer programming model proposed for the problem. With the new model, several problem instances taken from the literature or randomly generated were efficiently solved to optimality. Moreover, it is now possible to efficiently solve problem instances of larger sizes.
Acknowledgments
The authors would like to thank the two anonymous referees for their valuable feedback and suggestions which contributed to the improvement of the original version of this paper.
Disclosure statement
No potential conflict of interest was reported by the authors.