Back to Search
Start Over
A Branch and Bound Algorithm for Project Scheduling Problem with Spatial Resource Constraints
- Source :
- Mathematical Problems in Engineering, Vol 2015 (2015)
- Publication Year :
- 2015
- Publisher :
- Hindawi Publishing Corporation, 2015.
-
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.
- Subjects :
- Schedule
Mathematical optimization
Branch and bound
Job shop scheduling
Article Subject
Computer science
Heuristic
Heuristic (computer science)
General Mathematics
Node (networking)
lcsh:Mathematics
General Engineering
lcsh:QA1-939
Upper and lower bounds
Resource (project management)
lcsh:TA1-2040
lcsh:Engineering (General). Civil engineering (General)
Algorithm
Block (data storage)
Subjects
Details
- Language :
- English
- ISSN :
- 1024123X
- Database :
- OpenAIRE
- Journal :
- Mathematical Problems in Engineering
- Accession number :
- edsair.doi.dedup.....112bda166a58a2cb01fd935d7a7f2b67
- Full Text :
- https://doi.org/10.1155/2015/628259