RONNY, - (2017) SECURITY SCHEDULING USING GENETIC ALGORITHM. Other thesis, Unika Soegijapranata Semarang.

Preview	Text (COVER) 13.02.0148 Ronny COVER.pdf Download (2MB) | Preview
Preview	Text (BAB I) 13.02.0148 Ronny BAB I.pdf Download (98kB) | Preview
	Text (BAB II) 13.02.0148 Ronny BAB II.pdf Restricted to Registered users only Download (120kB)
Preview	Text (BAB III) 13.02.0148 Ronny BAB III.pdf Download (94kB) | Preview
Preview	Text (BAB IV) 13.02.0148 Ronny BAB IV.pdf Download (456kB) | Preview
Preview	Text (BAB V) 13.02.0148 Ronny BAB V.pdf Download (337kB) | Preview
Preview	Text (BAB VI) 13.02.0148 Ronny BAB VI.pdf Download (94kB) | Preview
Preview	Text (DAFTAR PUSTAKA) 13.02.0148 Ronny DAFTAR PUSTAKA.pdf Download (61kB) | Preview

Abstract

Scheduling is to manage life easier and more effective. It informs us about what to do, and when we do it. Many scheduling are still arranged manually, including security scheduling. Good schedule have no collisions in it, such as collision between security that guard in a day, or time collision. This project is to generate security schedule. With genetic algorithm that usually used in schedule optimization and Java programming language. First step of genetic algorithm is to initialize a population of data. And the value of each population will be calculated. After that each population will pass crossover and mutation processes. Finally, the schedule will be displayed. The expectation of this project is to make security scheduling easier and more effective without any collisions.

Actions (login required)

View Item