OPTIMASI PENJADWALAN KOAS DENGAN METODE BRANCH AND PRICE

�Kepaniteraan klinik� program is an important part of the medical education system. �Paniteraan clinic� program is a medical education period emphasizing on the application of previous theories obtained from pre-clinic period. This program is conducted in hospitals or in pointed health cente...

Full description

Saved in:
Bibliographic Details
Main Authors: , PULUT SURYATI, , Prof. Drs. Subanar, Ph.D.
Format: Theses and Dissertations NonPeerReviewed
Published: [Yogyakarta] : Universitas Gadjah Mada 2014
Subjects:
ETD
Online Access:https://repository.ugm.ac.id/134446/
http://etd.ugm.ac.id/index.php?mod=penelitian_detail&sub=PenelitianDetail&act=view&typ=html&buku_id=77024
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Universitas Gadjah Mada
id id-ugm-repo.134446
record_format dspace
spelling id-ugm-repo.1344462016-03-04T08:06:58Z https://repository.ugm.ac.id/134446/ OPTIMASI PENJADWALAN KOAS DENGAN METODE BRANCH AND PRICE , PULUT SURYATI , Prof. Drs. Subanar, Ph.D. ETD �Kepaniteraan klinik� program is an important part of the medical education system. �Paniteraan clinic� program is a medical education period emphasizing on the application of previous theories obtained from pre-clinic period. This program is conducted in hospitals or in pointed health centers. Doctor candidates conducting this program are often called trainee. The trainee scheduling is a set of management for some trainees allocated to some units in a certain period which is not an easy job. This thesis proposes a trainee scheduling optimality system as an integer programming problems which then will be solved by using branch and price method. This problem consists of objective function that is to minimize violation constraint as a total penalty cost and constraints function which contains of capacity constraints, formation requirements constraints, non availability constraints and set-up constraints also including maximum limit for consecutive activities consecutive holidays. The test result showed that this application can give solution in the completion of trainee scheduling problem optimally, but the model and the system built are still unable to solve the real scheduling case among medical trainees. The solution could be obtained at 82,3% duration, 62,5% group number and 41,7% unit number from the real case with testing time less than 60 minutes. Key words : optimality, Scheduling, branch and price, integer prgramming [Yogyakarta] : Universitas Gadjah Mada 2014 Thesis NonPeerReviewed , PULUT SURYATI and , Prof. Drs. Subanar, Ph.D. (2014) OPTIMASI PENJADWALAN KOAS DENGAN METODE BRANCH AND PRICE. UNSPECIFIED thesis, UNSPECIFIED. http://etd.ugm.ac.id/index.php?mod=penelitian_detail&sub=PenelitianDetail&act=view&typ=html&buku_id=77024
institution Universitas Gadjah Mada
building UGM Library
country Indonesia
collection Repository Civitas UGM
topic ETD
spellingShingle ETD
, PULUT SURYATI
, Prof. Drs. Subanar, Ph.D.
OPTIMASI PENJADWALAN KOAS DENGAN METODE BRANCH AND PRICE
description �Kepaniteraan klinik� program is an important part of the medical education system. �Paniteraan clinic� program is a medical education period emphasizing on the application of previous theories obtained from pre-clinic period. This program is conducted in hospitals or in pointed health centers. Doctor candidates conducting this program are often called trainee. The trainee scheduling is a set of management for some trainees allocated to some units in a certain period which is not an easy job. This thesis proposes a trainee scheduling optimality system as an integer programming problems which then will be solved by using branch and price method. This problem consists of objective function that is to minimize violation constraint as a total penalty cost and constraints function which contains of capacity constraints, formation requirements constraints, non availability constraints and set-up constraints also including maximum limit for consecutive activities consecutive holidays. The test result showed that this application can give solution in the completion of trainee scheduling problem optimally, but the model and the system built are still unable to solve the real scheduling case among medical trainees. The solution could be obtained at 82,3% duration, 62,5% group number and 41,7% unit number from the real case with testing time less than 60 minutes. Key words : optimality, Scheduling, branch and price, integer prgramming
format Theses and Dissertations
NonPeerReviewed
author , PULUT SURYATI
, Prof. Drs. Subanar, Ph.D.
author_facet , PULUT SURYATI
, Prof. Drs. Subanar, Ph.D.
author_sort , PULUT SURYATI
title OPTIMASI PENJADWALAN KOAS DENGAN METODE BRANCH AND PRICE
title_short OPTIMASI PENJADWALAN KOAS DENGAN METODE BRANCH AND PRICE
title_full OPTIMASI PENJADWALAN KOAS DENGAN METODE BRANCH AND PRICE
title_fullStr OPTIMASI PENJADWALAN KOAS DENGAN METODE BRANCH AND PRICE
title_full_unstemmed OPTIMASI PENJADWALAN KOAS DENGAN METODE BRANCH AND PRICE
title_sort optimasi penjadwalan koas dengan metode branch and price
publisher [Yogyakarta] : Universitas Gadjah Mada
publishDate 2014
url https://repository.ugm.ac.id/134446/
http://etd.ugm.ac.id/index.php?mod=penelitian_detail&sub=PenelitianDetail&act=view&typ=html&buku_id=77024
_version_ 1681233865282158592