• Login
    View Item 
    •   Home
    • Research Publications
    • Research Centres & Groups
    • Centre for Business Improvement
    • View Item
    •   Home
    • Research Publications
    • Research Centres & Groups
    • Centre for Business Improvement
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of UDORACommunitiesTitleAuthorsIssue DateSubmit DateSubjectsThis CollectionTitleAuthorsIssue DateSubmit DateSubjects

    My Account

    LoginRegister

    About and further information

    AboutOpen Access WebpagesOpen Access PolicyTake Down Policy University Privacy NoticeUniversity NewsTools for ResearchersLibraryUDo

    Statistics

    Display statistics

    Resource allocation in multi-class dynamic PERT networks with finite capacity

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    Publisher version
    View Source
    Access full-text PDFOpen Access
    View Source
    Check access options
    Check access options
    Thumbnail
    Name:
    EOR13045 (Brian).pdf
    Size:
    617.4Kb
    Format:
    PDF
    Description:
    Post-print
    Download
    Authors
    Yaghoubi, Saeed
    Noori, Siamak
    Azaron, Amir
    Fynes, Brian
    Affiliation
    University College Dublin
    Issue Date
    2015-06-24
    
    Metadata
    Show full item record
    Abstract
    In this paper, the resource allocation problem in multi-class dynamic PERT networks with finite capacity of concurrent projects (COnstant Number of Projects In Process (CONPIP)) is studied. The dynamic PERT network is modeled as a queuing network, where new projects from different classes (types) are generated according to independent Poisson processes with different rates over the time horizon. Each activity of a project is performed at a devoted service station with one server located in a node of the network, whereas activity durations for different classes in each service station are independent and exponentially distributed random variables with different service rates. Indeed, the projects from different classes may be different in their precedence networks and also the durations of the activities. For modeling the multi-class dynamic PERT . networks with CONPIP, we first consider every class separately and convert the queueing network of every class into a proper stochastic network. Then, by constructing a proper finite-state continuous-time Markov model, a system of differential equations is created to compute the project completion time distribution for any particular project. The problem is formulated as a multi-objective model with three objectives to optimally control the resources allocated to the service stations. Finally, we develop a simulated annealing (SA) algorithm to solve this multi-objective problem, using the goal attainment formulation.We also compare the SA results against the results of a discrete-time approximation of the original optimal control problem, to show the effectiveness of the proposed solution technique.
    Citation
    Yaghoubi, S., Noori, S., Azaron, A. and Fynes, B., (2015). 'Resource allocation in multi-class dynamic PERT networks with finite capacity'. European Journal of Operational Research, 247(3), pp.879-894. DOI: 10.1016/j.ejor.2015.06.038
    Publisher
    Elsevier.
    Journal
    European Journal of Operational Research.
    URI
    http://hdl.handle.net/10545/623375
    DOI
    10.1016/j.ejor.2015.06.038
    Additional Links
    https://linkinghub.elsevier.com/retrieve/pii/S0377221715005524
    Type
    Article
    Language
    en
    ISSN
    03772217
    ae974a485f413a2113503eed53cd6c53
    10.1016/j.ejor.2015.06.038
    Scopus Count
    Collections
    Centre for Business Improvement

    entitlement

     
    DSpace software (copyright © 2002 - 2021)  DuraSpace
    Quick Guide | Contact Us
    Open Repository is a service operated by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.