• Login
    View Item 
    •   Home
    • UNDERGRADUATE THESES (Koleksi Skripsi Sarjana)
    • UT-Faculty of Mathematics and Natural Sciences
    • View Item
    •   Home
    • UNDERGRADUATE THESES (Koleksi Skripsi Sarjana)
    • UT-Faculty of Mathematics and Natural Sciences
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Penerapan Precedence Diagram Method (Pdm) Untuk Optimasi Penjadwalan dan Biaya Proyek dengan Pendekatan Algoritma Genetika

    Thumbnail
    View/Open
    Nurmala Agita Nisa_Repo.pdf (1.136Mb)
    Date
    2023-07-27
    Author
    NISA, Nurmala Agita
    Metadata
    Show full item record
    Abstract
    Planning project activities is an important issue that needs to be considered. This is because planning serves as the foundation for completing a project in an optimal timeframe. The timing of construction project implementation must be designed optimally to avoid delays or excesses, as well as other impacts such as significant cost increases. Project scheduling is a part of the planning process that includes information about the planned schedule and project progress in terms of resource performance, including costs, workers, equipment, materials, and project duration. The scheduling model used in this research is the Precedence Diagram Method (PDM). PDM is a network diagram that falls under the Activity on Node (AON) group, which identifies critical paths. Critical paths are the paths of activities that must not be delayed. When it comes to accelerating the project duration, these critical paths are the ones that will be expedited. PDM calculations can be solved using the Genetic Algorithm approach. Genetic Algorithms are stochastic search algorithms based on natural selection and genetic mechanisms. Genetic Algorithms begin with an initial random set of solutions called a population, which represents the constraints of an optimization problem. This study used 10 iterations, where the population from iteration 1 is used as the population for iteration 2, and so on. To obtain the final chromosome, the same calculations as in iteration 1 are performed. Once the chromosomes for the entire population size are obtained, the chromosome with the minimum acceleration cost is selected. In the 10th iteration, the best chromosome with a fitness value of 0.2650 was found. This chromosome contains the genes 1 1 4 4 1 1, which means the optimal duration acceleration with the least cost increase is achieved by extending the working hours of Task A by 1 hour, Task B by 1 hour, Task C by 4 hours, Task D by 4 hours, Task E by 1 hour, and Task F by 1 hour.
    URI
    https://repository.unej.ac.id/xmlui/handle/123456789/122180
    Collections
    • UT-Faculty of Mathematics and Natural Sciences [3451]

    UPA-TIK Copyright © 2024  Library University of Jember
    Contact Us | Send Feedback

    Indonesia DSpace Group :

    University of Jember Repository
    IPB University Scientific Repository
    UIN Syarif Hidayatullah Institutional Repository
     

     

    Browse

    All of RepositoryCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    Context

    Edit this item

    UPA-TIK Copyright © 2024  Library University of Jember
    Contact Us | Send Feedback

    Indonesia DSpace Group :

    University of Jember Repository
    IPB University Scientific Repository
    UIN Syarif Hidayatullah Institutional Repository