1 to 10 of 26 Results
Purba Daru Kusuma, 2022, "Weighted round robin based production scheduling model for seasonal product", https://doi.org/10.34820/FK2/0KEBDV, Telkom University Dataverse, V1
In this work, we propose new approach in production scheduling model based on Weighted Round Robin (WRR) scheduling method which is common in computer and networking fields. |
Purba Daru Kusuma, 2022, "Weighted Round Robin (WRR) Based Replenishment Model in Vendor Managed Inventory (VMI) System", https://doi.org/10.34820/FK2/YLMJQ3, Telkom University Dataverse, V1
This work aims to improve VMI by implementing Weighted Round Robin (WRR), a popular scheduling model in computer system, in the replenishment model in VMI. WRR is popular because of its load balancing nature. Environment in this work is two-echelon supply chain. The vendor is a m... |
Purba Daru Kusuma; Abduh Sayid Albana, 2022, "University Course Timetabling Model in Joint Courses Program to Minimize the Number of Unserved Requests", https://doi.org/10.34820/FK2/QD1ZVN, Telkom University Dataverse, V1
This work proposes a novel course timetable model for the national joint courses program. In this model, the participants, both students and lecturers, come from different universities. |
Purba Daru Kusuma, 2022, "Truck Scheduling Model in the Cross-docking Terminal by using Multi-agent System and Shortest Remaining Time Algorithm", https://doi.org/10.34820/FK2/T8ZKCA, Telkom University Dataverse, V1
In this work, we propose new truck scheduling model in a cross-docking terminal with limited temporary storage constraint. This model is developed by using multi-agent system. The main contribution of this work is proposing the multi-agent based truck scheduling model with limite... |
Purba Daru Kusuma; Ratna Astuti Nugrahaeni, 2022, "Stochastic Marine Predator Algorithm with Multiple Candidates", https://doi.org/10.34820/FK2/AUZLXG, Telkom University Dataverse, V1
This work proposes a metaheuristic algorithm that modifies the marine predator algorithm (MPA), namely, the stochastic marine predator algorithm with multiple candidates (SMPA-MC). The modification is conducted in several aspects. The proposed algorithm replaces the three fixed e... |
Purba Daru Kusuma; Meta Kallista, 2022, "Stochastic Komodo Algorithm", https://doi.org/10.34820/FK2/UQKWB2, Telkom University Dataverse, V1
A novel metaheuristic algorithm is proposed in this paper, namely stochastic komodo algorithm (SKA). This proposed algorithm is an improved version of Komodo mlipir algorithm (KMA), which is inspired by the behaviour of Komodo during foraging and mating. The improvement is conduc... |
Purba Daru Kusuma; Meta Kallista, 2022, "Pickup and delivery problem in the collaborative city courier service by using genetic algorithm and nearest distance", https://doi.org/10.34820/FK2/3X9FNO, Telkom University Dataverse, V1
This work aimed to propose a novel collaborative PDP model which minimizes total travel distance while maintains low outsourced jobs. |
Purba Daru Kusuma, 2022, "Multi-parameter Coordinated Public School Admission Model by using Stable Marriage", https://doi.org/10.34820/FK2/4TZFSM, Telkom University Dataverse, V1
This work proposes coordinated public school admission model that accommodates flexible number of the concerned parameters. It is built based on the stable marriage algorithm or the deferred-acceptance algorithm as its derivative. |
Purba Daru Kusuma, 2022, "Multi-objective batch scheduling in collaborative multi-product flow shop system by using non-dominated sorting genetic algorithm", https://doi.org/10.34820/FK2/APKG5I, Telkom University Dataverse, V1
This work aims to develop a novel batch scheduling model for a collaborative multi-product flow shop system. Its objective is to minimize make-span and total production cost. This model is developed by using non-dominated sorting genetic algorithm (NSGA II) which is proven in man... |
Purba Daru Kusuma; Meta Kallista, 2022, "Multi-Depot Capacitated Vehicle Routing Problem by Using Stable Marriage and K-Means Clustering to Minimize Number of Unserved Customers and Total Travel Distance", https://doi.org/10.34820/FK2/DOCE82, Telkom University Dataverse, V1
This work aims to minimize the total travel distance and the number of unserved customers in single routing cycle. The solution is developed by combining the stable marriage algorithm and k-means clustering in the clustering process. The nearest neighbour algorithm is used in the... |
