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

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 precedenc...

Full description

Bibliographic Details
Main Authors: Shicheng Hu, Song Wang, Yonggui Kao, Takao Ito, Xuedong Sun
Format: Article
Language:English
Published: Hindawi Limited 2015-01-01
Series:Mathematical Problems in Engineering
Online Access:http://dx.doi.org/10.1155/2015/628259