PAPER 1

Problem :

From the paper that was given, the conclusion of the main problem is that the YAKKUM has
lack of front office worker compare their operational worker needs. The company operates
on 7 consecutive days each week, with operational time 24hrs/day. From the operational
time, the company divides it becoming 3 shift a day that is morning shift (M), evening shift
(E), and night shift (N). YAKKUM has 3 workers that should work on the operational time.
From the calculation, between the operational time and the maximum time to work for worker
(base on law), there was a lack of worker resource. However the company uses a cyclic
system to solve this problem, and use over time work to the worker, so each worker can has
their own off day each week.

They already implement a rotating worker system, based on their needed and their rules of
worker time. The rules are that each worker should have 1 off-day and one overtime work on
each week. And when one worker assign on off-day, means that there will be another worker
that should do the overtime work. The rotating system works on a cyclic period that last for
6work day, with the sequence N-N-E-ME-M-O. That mean that after two days work on the
night shift, the worker should work on evening shift, then in morning shift and evening shift
and do the overtime work, and then he should do the morning shift, after that he can take a
rest in off day.

However the problem comes from the worker that has overtime work and should work twice
shift on the same day. The worker tends to be late in the morning because they already work
until 11a.m on the previous day. Thats mean that the company should consider the break
time between each assigned job schedule for worker that can be used to take a rest for the
worker.

Methods :

To solve the problem, the author uses her own algorithm with 4 steps:

1. Determination of work stretch in 1 cycle period

2. Determination of overtime pattern in 1 cycle period
3. Determination of shift pattern in 1 cycle period
4. Determination of shift pattern in 1 cycle period that satisfy between-days break-time
constraint.
Result:

From the calculation on step 1-2 will result a raw schedule to the worker. Then on step 3,
and step 4 is the method to finding the best alternative that can be used to the worker
scheduling.

Step 3 is the method that will found the 12 Alternatives Schedule that can be implemented
on the worker scheduling. Here are the alternative schedule that still multiplies by 2 for
alternative using M-E as overtime work and E-N as overtime work.

In step 4 the author will compare those alternatives, and calculate the number of breaking
time if implement each schedule. Then the author shows the result on the table.

The best alternative is the alternative that has the most number of tie-break for the workers.
Because the schedule will make the worker can have more leisure time between each
schedule, also make the worker can work efficiently while he/she works after the enough rest
time. Therefore the author chooses the 5th alternative as the best alternative in spite of the
others. The other consideration is the least standard deviation between minimum and
maximum break-time is on the 5th alternative.

Conclusion :

The best alternative that can be reach in this problem based on the author research is on the
5th alternative that can accommodate the most break time, also can reach the needs of each
day scheduling.
 PAPER 2

Problem :
The problem that was solved in the paper is the work force problem in a shop that located in
Yogyakarta, Indonesia. The shop has 12 hours operational time. In the current scheduling,
the owner has divided jobs into 2 shifts, that is the morning shift and the afternoon shift. 2
workers work on the morning shift, and 2 workers work on the afternoon shift, however there
are 2 workers that have working time for 12 hours. That means that the shop has already
violate the law of worker that stated for each worker has maximum working time for 40hours
a week that divided in 8hrs a day.
The other problems that showed are that there are some specific job that only can be done
by some workers. The job is delivering the furniture to the customer house. While the other
job is to assist the customer when they choose the products.
The other constraint or consideration to arrange the schedule is the needs of the workers for
each hour that has already calculate by the owner. Because each time there are different
number of customer that come to buy furniture and it will imply to the number of worker.
Moreover the difference between each day is significantly changed on the Saturday when
most of people have off day on the weekend. Therefore to classify the schedule, the author
separates the needs on the Saturday and on the work day.
Methods :
The author using the customize RDO Scheduling with the specification of the shop. Here are
the iteration processes that used by the author:
a. Calculate the number of worker needs
b. Determine the needed of worker each week
c. Analysis the gap between worker needs based on the working day
d. Define the possibilities shift that might happen
e. Arrange the shift based on the worker needs
f. Define the number of shift and number of worker each shift
g. Define weekly shift pattern
h. Allocate the shift pattern on Mebel Beta Jaya Shop

Results :

From the 1st and 2nd step, the author can conclude the number of worker needs for whole
week.
Then author uses the RDO Iteration for solve the 3rd and 6th step. While on the 4th step, the
authors use the different approach based on the reality on the current status quo that
happen. From the 3rd until 6th step, will result the number of worker with the shift that will
implement on the shop.

From the 7th step results the pattern of the scheduling based on the needs of worker.
However this is not the final step, because there will be next adjustment on the 8th step.

On the 8th step is the final adjustment of the schedule that matches the ability of the worker.
Therefore the schedule is the best schedule, and can be implementing in the shop.

Conclusion :

To make a schedule that fit a company, we need to look into the needs of the company.
Therefore we also should customize it into the needs of the company.
 PAPER 3

Problem :

A hard-disk company in Thailand has problem in their scheduling system. At first they
already have a proper schedule that fit with the regulation of the EICC, that use 4 workday
and 2 off day in cyclic. However refer to the number of demand, company apply the overtime
work to the employee with some combination. Based on the current demand, usually the
worker using the 5-1 overtime working schedule that makes them to work 5days a week and
have rest time for 1 day. Then the 5-1 working schedule is not the best scheduling system,
because it almost violate the EICC term for employee working time. Therefore the company
will make a new system to obey the regulation. The current job in the company is working by
using 6 regular team lines, and 1 stagger team. Stagger team is a team that works while the
other time is in the resting time.

Methods :

The methods to solve the problem will use break problem development, and work pattern
development approach.

1. Break problem development:

a. Break problem algorithm
b. Break problem program (using Microsoft word)
2. Work pattern Development:
a. Work pattern algorithm
b. Work pattern program
c. Work pattern analysis
d. Validation the user

Results :

a. The best break schedule that might happen

 b. The best break schedule achieve when one stag team handle 6 lines
c. The best work pattern that follow the regulation

d. As the same work pattern is applied for all crews, combination of assignment for all
crews regarding with shift work named shift schedule is generated. The best result of
shift schedule can be seen in Fig. 6.

Conclusion :

To choose the best alternative, we should to look into the regulation then we can calculate
the better solution to the case.