IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v71y2020i3p475-490.html
   My bibliography  Save this article

An improved model for the parallel row ordering problem

Author

Listed:
  • Xuhong Yang
  • Wenming Cheng
  • Alice E. Smith
  • André R. S. Amaral

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.

Suggested Citation

  • Xuhong Yang & Wenming Cheng & Alice E. Smith & André R. S. Amaral, 2020. "An improved model for the parallel row ordering problem," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 71(3), pages 475-490, March.
    • Handle: RePEc:taf:tjorxx:v:71:y:2020:i:3:p:475-490
    DOI: 10.1080/01605682.2018.1556570
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2018.1556570
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2018.1556570?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Dahlbeck, Mirko & Fischer, Anja & Fischer, Frank, 2020. "Decorous combinatorial lower bounds for row layout problems," European Journal of Operational Research, Elsevier, vol. 286(3), pages 929-944.
    2. Dahlbeck, Mirko & Fischer, Anja & Fischer, Frank & Hungerländer, Philipp & Maier, Kerstin, 2023. "Exact approaches for the combined cell layout problem," European Journal of Operational Research, Elsevier, vol. 305(2), pages 530-546.
    3. Gintaras Palubeckis & Armantas Ostreika & Jūratė Platužienė, 2022. "A Variable Neighborhood Search Approach for the Dynamic Single Row Facility Layout Problem," Mathematics, MDPI, vol. 10(13), pages 1-27, June.
    4. Dahlbeck, Mirko, 2021. "A mixed-integer linear programming approach for the T-row and the multi-bay facility layout problem," European Journal of Operational Research, Elsevier, vol. 295(2), pages 443-462.
    5. Xing Wan & Xing-Quan Zuo & Xin-Chao Zhao, 2021. "A Surrogate Model-Based Hybrid Approach for Stochastic Robust Double Row Layout Problem," Mathematics, MDPI, vol. 9(15), pages 1-18, July.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tjorxx:v:71:y:2020:i:3:p:475-490. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.