ASSIGNMENT MODULE 8

OPERATION SCHEDULING

Your company is producing paper towels, pulp as the main material of paper towel
supplied from the company's suppliers. The pulp material is processed by the paper
machinery department by squeezing, rolling, and drying into giant rolls of raw white paper.
Big sheet shaped paper is ready to be converted into smaller rolls. Smaller rolls will be cut
into individual size rolls of paper towels.

Paper towel will be built at four work centres in the following manners:

Table 1. Methods of Making Paper Towel

W/C 1 Paper gets perforated and embossed
W/C 2 Roll paper towel into “logs” and gets paired with cardboard tube
W/C 3 Paper towel sliced into individual size
W/C 4 Wrapping and boxing paper towel

Your company has five jobs which have identical routings according to which jobs
should flow through four work centres in the same order. All five jobs are available at the
start of the schedule and their setup times are independent. The respective processing time (in
minutes) of each job for each work centre is given as follow:

Table 2. Estimated Processing Time

JOBS W/C 1 W/C 2 W/C 3 W/C 4
Job 1 14 17 17 18
Job 2 12 21 24 21
Job 3 19 9 21 9
Job 4 23 11 13 11
Job 5 8 21 8 22

Your company wants to find the schedule which minimizes the make-span required to
process all these jobs by using Campbell, Dudek, and Smith (CDS) Algorithm. Show the
solution by using a table and Gantt chart. To which answers to more than one, choose the
best answer with the reason. Beside finding the right schedule for the machine, your
company has to find the best and effective schedule for operator scheduling. Each operator
has two consecutive days off. The table below showed operator needed for each day in a
week:

Table 3. Number of Operator Needed for One Week

Days Monday Tuesday Wednesday Thursday Friday Saturday Sunday
Operator
13 16 10 14 12 13 14
Needed

Using Software LINGO to determine employee scheduling and find the best solution
for operator scheduling.
Remark:
The data of estimated processing time per job and number of operators needed for one week
added with 1 last digit from the leader of group members student ID number.
Example: Alpha 2001450918

The data of estimated processing time per job on Job 1 (W/C 1) became:
14 + 8 = 21
*Applied it to all data