Graph-based constraints analysis approach for project scoping

Project scoping is a changeable problem in project management. In this paper, a graph-based constraints analysis approach was proposed to solve the project scoping problem. It firstly build a directed graph based on the dependencies among the requirements, secondly update the connected graph based o...

Full description

Saved in:
Bibliographic Details
Main Authors: Li, Feng, Chen, Hao, Dang, Yabin, Zhou, Xin, Li, ShaoChun, Zhao, Xinyu
Format: Conference Proceeding
Language:English
Subjects:
Manganese
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 399
container_issue
container_start_page 394
container_title
container_volume
creator Li, Feng
Chen, Hao
Dang, Yabin
Zhou, Xin
Li, ShaoChun
Zhao, Xinyu
description Project scoping is a changeable problem in project management. In this paper, a graph-based constraints analysis approach was proposed to solve the project scoping problem. It firstly build a directed graph based on the dependencies among the requirements, secondly update the connected graph based on user defined inclusive and exclusive constraints, thirdly find the connected sub-graph set, fourthly verify the constraints for sub-graph and determine all candidate sub-graph sets, and finally determine solution for the project scoping problem through solving a Knapsack problem. The proposed approach was illustrated through a simple example and validated by real cases. Through the experiments, the proposed approach is efficient and validate in practice.
doi_str_mv 10.1109/SOLI.2014.6960757
format conference_proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6960757</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6960757</ieee_id><sourcerecordid>6960757</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-68cbf9601b3da156153629cecd9db6449647e3caf5835052c0bdcfe6077c080c3</originalsourceid><addsrcrecordid>eNotj71OwzAUhc2ABJQ-AGLJCyRcx3_xwIAqaCtF6kA7V_a1Q12VxLKz9O2xRKfzneXoO4S8UGgoBf32veu3TQuUN1JLUELdkSfKlS5FdPKBLHM-AwDVUoPgj-R9nUw81dZk7yqcxjwnE8Y5V2Y0l2sOBWJMk8FTNUypKnj2OFcZpxjGn2dyP5hL9stbLsjh63O_2tT9br1dffR1oErMtezQDsWAWuYMFZIKJluNHp12VnKuJVeeoRlExwSIFsE6HHzxVwgdIFuQ1__d4L0_xhR-Tboebw_ZH1nVRzc</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Graph-based constraints analysis approach for project scoping</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Li, Feng ; Chen, Hao ; Dang, Yabin ; Zhou, Xin ; Li, ShaoChun ; Zhao, Xinyu</creator><creatorcontrib>Li, Feng ; Chen, Hao ; Dang, Yabin ; Zhou, Xin ; Li, ShaoChun ; Zhao, Xinyu</creatorcontrib><description>Project scoping is a changeable problem in project management. In this paper, a graph-based constraints analysis approach was proposed to solve the project scoping problem. It firstly build a directed graph based on the dependencies among the requirements, secondly update the connected graph based on user defined inclusive and exclusive constraints, thirdly find the connected sub-graph set, fourthly verify the constraints for sub-graph and determine all candidate sub-graph sets, and finally determine solution for the project scoping problem through solving a Knapsack problem. The proposed approach was illustrated through a simple example and validated by real cases. Through the experiments, the proposed approach is efficient and validate in practice.</description><identifier>EISBN: 1479960586</identifier><identifier>EISBN: 9781479960583</identifier><identifier>DOI: 10.1109/SOLI.2014.6960757</identifier><language>eng</language><publisher>IEEE</publisher><subject>Manganese</subject><ispartof>Proceedings of 2014 IEEE International Conference on Service Operations and Logistics, and Informatics, 2014, p.394-399</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6960757$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6960757$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Li, Feng</creatorcontrib><creatorcontrib>Chen, Hao</creatorcontrib><creatorcontrib>Dang, Yabin</creatorcontrib><creatorcontrib>Zhou, Xin</creatorcontrib><creatorcontrib>Li, ShaoChun</creatorcontrib><creatorcontrib>Zhao, Xinyu</creatorcontrib><title>Graph-based constraints analysis approach for project scoping</title><title>Proceedings of 2014 IEEE International Conference on Service Operations and Logistics, and Informatics</title><addtitle>SOLI</addtitle><description>Project scoping is a changeable problem in project management. In this paper, a graph-based constraints analysis approach was proposed to solve the project scoping problem. It firstly build a directed graph based on the dependencies among the requirements, secondly update the connected graph based on user defined inclusive and exclusive constraints, thirdly find the connected sub-graph set, fourthly verify the constraints for sub-graph and determine all candidate sub-graph sets, and finally determine solution for the project scoping problem through solving a Knapsack problem. The proposed approach was illustrated through a simple example and validated by real cases. Through the experiments, the proposed approach is efficient and validate in practice.</description><subject>Manganese</subject><isbn>1479960586</isbn><isbn>9781479960583</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2014</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotj71OwzAUhc2ABJQ-AGLJCyRcx3_xwIAqaCtF6kA7V_a1Q12VxLKz9O2xRKfzneXoO4S8UGgoBf32veu3TQuUN1JLUELdkSfKlS5FdPKBLHM-AwDVUoPgj-R9nUw81dZk7yqcxjwnE8Y5V2Y0l2sOBWJMk8FTNUypKnj2OFcZpxjGn2dyP5hL9stbLsjh63O_2tT9br1dffR1oErMtezQDsWAWuYMFZIKJluNHp12VnKuJVeeoRlExwSIFsE6HHzxVwgdIFuQ1__d4L0_xhR-Tboebw_ZH1nVRzc</recordid><startdate>201410</startdate><enddate>201410</enddate><creator>Li, Feng</creator><creator>Chen, Hao</creator><creator>Dang, Yabin</creator><creator>Zhou, Xin</creator><creator>Li, ShaoChun</creator><creator>Zhao, Xinyu</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201410</creationdate><title>Graph-based constraints analysis approach for project scoping</title><author>Li, Feng ; Chen, Hao ; Dang, Yabin ; Zhou, Xin ; Li, ShaoChun ; Zhao, Xinyu</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-68cbf9601b3da156153629cecd9db6449647e3caf5835052c0bdcfe6077c080c3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Manganese</topic><toplevel>online_resources</toplevel><creatorcontrib>Li, Feng</creatorcontrib><creatorcontrib>Chen, Hao</creatorcontrib><creatorcontrib>Dang, Yabin</creatorcontrib><creatorcontrib>Zhou, Xin</creatorcontrib><creatorcontrib>Li, ShaoChun</creatorcontrib><creatorcontrib>Zhao, Xinyu</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE/IET Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Li, Feng</au><au>Chen, Hao</au><au>Dang, Yabin</au><au>Zhou, Xin</au><au>Li, ShaoChun</au><au>Zhao, Xinyu</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Graph-based constraints analysis approach for project scoping</atitle><btitle>Proceedings of 2014 IEEE International Conference on Service Operations and Logistics, and Informatics</btitle><stitle>SOLI</stitle><date>2014-10</date><risdate>2014</risdate><spage>394</spage><epage>399</epage><pages>394-399</pages><eisbn>1479960586</eisbn><eisbn>9781479960583</eisbn><abstract>Project scoping is a changeable problem in project management. In this paper, a graph-based constraints analysis approach was proposed to solve the project scoping problem. It firstly build a directed graph based on the dependencies among the requirements, secondly update the connected graph based on user defined inclusive and exclusive constraints, thirdly find the connected sub-graph set, fourthly verify the constraints for sub-graph and determine all candidate sub-graph sets, and finally determine solution for the project scoping problem through solving a Knapsack problem. The proposed approach was illustrated through a simple example and validated by real cases. Through the experiments, the proposed approach is efficient and validate in practice.</abstract><pub>IEEE</pub><doi>10.1109/SOLI.2014.6960757</doi><tpages>6</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier EISBN: 1479960586
ispartof Proceedings of 2014 IEEE International Conference on Service Operations and Logistics, and Informatics, 2014, p.394-399
issn
language eng
recordid cdi_ieee_primary_6960757
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Manganese
title Graph-based constraints analysis approach for project scoping
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T00%3A53%3A50IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Graph-based%20constraints%20analysis%20approach%20for%20project%20scoping&rft.btitle=Proceedings%20of%202014%20IEEE%20International%20Conference%20on%20Service%20Operations%20and%20Logistics,%20and%20Informatics&rft.au=Li,%20Feng&rft.date=2014-10&rft.spage=394&rft.epage=399&rft.pages=394-399&rft_id=info:doi/10.1109/SOLI.2014.6960757&rft.eisbn=1479960586&rft.eisbn_list=9781479960583&rft_dat=%3Cieee_6IE%3E6960757%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i175t-68cbf9601b3da156153629cecd9db6449647e3caf5835052c0bdcfe6077c080c3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6960757&rfr_iscdi=true