IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/628259.html
   My bibliography  Save this article

A Branch and Bound Algorithm for Project Scheduling Problem with Spatial Resource Constraints

Author

Listed:
  • Shicheng Hu
  • Song Wang
  • Yonggui Kao
  • Takao Ito
  • Xuedong Sun

Abstract

With respect to the block assembly schedule in a shipbuilding enterprise, a spatial resource constrained project scheduling problem (SRCPSP) is proposed, which aims to minimize the makespan of a project under the constraints of the availability of a two-dimensional spatial resource and the precedence relationship between tasks. In order to solve SRCPSP to the optimum, a branch and bound algorithm (BB) is developed. For the BB-SRCPSP, first, an implicitly enumerative branch scheme is presented. Secondly, a precedence based lower bound, as well as an effective dominance rule, is employed for pruning. Next, a heuristic based algorithm is used to decide the order of a node to be selected for expansion such that the efficiency of the algorithm is further improved. In addition, a maximal space based arrangement is applied to the configuration of the areas required each day in an available area. Finally, the simulation experiment is conducted to illustrate the effectiveness of the BB-SRCPSP.

Suggested Citation

  • Shicheng Hu & Song Wang & Yonggui Kao & Takao Ito & Xuedong Sun, 2015. "A Branch and Bound Algorithm for Project Scheduling Problem with Spatial Resource Constraints," Mathematical Problems in Engineering, Hindawi, vol. 2015, pages 1-9, October.
    • Handle: RePEc:hin:jnlmpe:628259
    DOI: 10.1155/2015/628259
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2015/628259.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2015/628259.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2015/628259?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
    ---><---

    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:hin:jnlmpe:628259. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.