Kenji, Sachiyo and Sofianti, Tanika D. and Mahendra, Adhiguna (2019) Resource Allocation in Trucking System by Adopting Greedy Algorithm: A Case Study in Soekarno-Hatta International Airport. Bachelor thesis, Swiss German University.

Preview	Text Sachiyo Kenji 11507004 TOC.pdf Download (1MB) | Preview
	Text Sachiyo Kenji 11507004 1.pdf Restricted to Registered users only Download (706kB)
	Text Sachiyo Kenji 11507004 2.pdf Restricted to Registered users only Download (1MB)
	Text Sachiyo Kenji 11507004 3.pdf Restricted to Registered users only Download (1MB)
	Text Sachiyo Kenji 11507004 4.pdf Restricted to Registered users only Download (312kB)
	Text Sachiyo Kenji 11507004 5.pdf Restricted to Registered users only Download (222kB)
	Text Sachiyo Kenji 11507004 6.pdf Restricted to Registered users only Download (511kB)
Preview	Text Sachiyo Kenji 11507004 Ref.pdf Download (539kB) | Preview

Abstract

Due to the global economy that has become more competitive as time flows, price competitiveness holds one of the keys of success in most industries. This competition has created a tough challenge in regards of maintaining the business profitable by keeping operating cost of doing the business in control. It has led resource allocation to become very important in each business to avoid financial waste caused by over resource and an inefficient management of resource. In addition, resource usage also has a great dependency with the given task that should be completed. Assuming that task is given at a random time with a random workload, resource allocation has become a complex problem but yet important. In this research, we found that this problem is often occurs in trucking system which manages the delivery and is even more complex when each delivery is time sensitive. To find the solution for the such complexity, this research is being conducted for trucking system in Soekarno-Hatta International Airport which manages the delivery of flight catering to the aircraft. After trying to solve the problem in a lot of different approach, we concluded that an algorithm must be made to optimize the incoming tasks and it also requires the resources to be scheduled in order to allocate the resource in minimum amount. To that end, we use greedy algorithm’s concept and come up with different ways to schedule the resource and determine the required resource.

Item Type:	Thesis (Bachelor)
Uncontrolled Keywords:	Resource Allocation and Scheduling ; Flight Catering ; Greedy Algorithm ; Truck Scheduling and Assignment
Subjects:	T Technology > T Technology (General) > T55.4 Industrial engineering. Management engineering
Divisions:	Faculty of Engineering and Information Technology > Department of Industrial Engineering
Depositing User:	Adityatama Ratangga
Date Deposited:	19 May 2020 13:36
Last Modified:	19 May 2020 13:36
URI:	http://repository.sgu.ac.id/id/eprint/578

Actions (login required)

View Item