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

A project scheduling problem with spatial resource constraints and a corresponding guided local search algorithm

Author

Listed:
  • Shicheng Hu
  • Zhaoze Zhang
  • Song Wang
  • Yonggui Kao
  • Takao Ito

Abstract

Spatial area is a nonlinear resource encountered in many industries. Using the block assembly process in a shipbuilding company as a case study, we propose a project scheduling problem with spatial resource constraints (2D-RCPSP). Due to the two-dimensional properties of spatial resources, the 2D-RCPSP is more difficult to solve than the well-known NP-hard resource constrained project scheduling problem (RCPSP). For the 2D-RCPSP, we develop a sophisticated guided local search algorithm (GLS). The GLS incorporates penalty terms into the cost function and uses it, instead of the original objective function, to guide the search to the promising regions in search space. Furthermore, rapid improvement strategies are investigated in order to increase the efficiency of the local search. To test our GLS for the 2D-RCPSP, we have designed three classes of problem instances, two of which are adapted from the commonly referenced benchmark instance library PSPLIB for RCPSP, whereas the other is derived from real shipyard production data. Three types of tests, each for one class of instances, are implemented. The computational results on these instances as well as the tuning for key parameter in the GLS are presented.

Suggested Citation

  • Shicheng Hu & Zhaoze Zhang & Song Wang & Yonggui Kao & Takao Ito, 2019. "A project scheduling problem with spatial resource constraints and a corresponding guided local search algorithm," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 70(8), pages 1349-1361, August.
    • Handle: RePEc:taf:tjorxx:v:70:y:2019:i:8:p:1349-1361
    DOI: 10.1080/01605682.2018.1489340
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2018.1489340
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2018.1489340?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.

    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:70:y:2019:i:8:p:1349-1361. 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.