Scheduling
Scheduling
Scheduling is an important tool for
manufacturing and service industries,
where it can have a major impact on the
productivity of a process.
In manufacturing, the purpose of
scheduling is to minimize the production
time and costs, by telling a production
facility what to make, when, with which
staff, and on which equipment.
scheduling in service industries, such as
airlines and public transport, aim to
maximize the efficiency of the operation
and reduce costs.
Scheduling
Scheduling
Backward scheduling is planning the tasks from the
due date to determine the start date and/or any
changes in capacity required.
Forward scheduling is planning the tasks from the
start date to determine the shipping date or the due
date.
1.The benefits of production scheduling include:
2.Process change-over reduction
3.Inventory reduction, leveling
4.Reduced scheduling effort
5.Increased production efficiency
6.Labor load leveling
7.Accurate delivery date quotes
8.Real time information
Scheduling
Scheduling
Scheduling: Establishing the timing
of the use of equipment, facilities
and human activities in an
organization.
Effective scheduling can yield:
• Cost savings
• Increase in productivity
Scheduling
High-Volume Systems
Flow system: High-volume system
with Standardized equipment and
activities.
Flow-shop scheduling: Scheduling
for high-volume flow system.
Scheduling
High-Volume Success Factors
Process and product design
Preventive maintenance
Rapid repair when breakdown occurs
Optimal product mixes
Minimization of quality problems
Reliability and timing of supplies
Scheduling
Intermediate-Volume Systems
Outputs are between standardized
high-volume systems and made-to-
order job shops
• Run size, timing, and sequence of jobs
Economic run size:
2DS p
Q0
H p u
Scheduling Low-Volume
Scheduling
Systems
Loading - assignment of jobs to
process centers.
Sequencing - determining the
order in which jobs will be
processed.
Job-shop scheduling
• Scheduling for low-volume systems
with many variations in requirements.
Scheduling
Gantt Load Chart
Gantt chart - used as a visual aid
for loading and scheduling.
Work Mon. Tues. Wed. Thurs. Fri.
Center
1 Job 3 Job 4
2 Job 3 Job 7
3 Job 1 Job 6 Job 7
4 Job 10
Scheduling
Load Chart
Load chart – A type of Gantt Chart that
shows the loading and idle times for a
group of machines or list of departments.
Schedule chart – A type of Gantt Chart that
shows the orders or jobs in progress and
whether they are on schedule or not.
Input/Output Control Chart – A type of
Control Chart that shows management of
work flow and queues at the work centers.
Scheduling
Loading
1. Infinite loading
2. Finite loading
3. Vertical loading
4. Horizontal loading
5. Forward scheduling
6. Backward scheduling
7. Schedule chart
Scheduling
Loading
1. Infinite loading: Jobs are assigned to work centers
without regard to the capacity of the work center.
2. Finite loading: Jobs are assigned to work centers with
regard to the capacity of the work center and job
processing times.
3. Vertical loading: Loading jobs at a work center, job by
job, usually according to some priority criterion, using
infinite loading i.e. Jobs are assigned to work centers
without regard to the capacity of the work center.
4. Horizontal loading: Loading each job on all work
centers it will require, then the next job on all work
centers, according to some priority, using finite loading
i.e. Jobs are assigned to work centers with regard to
the capacity of the work center and job processing
times.
Scheduling
Loading
5. Forward scheduling: Scheduling
ahead, from some point in time.
6. Backward scheduling: Scheduling
by working backwards from the
due date.
7. Schedule chart: A Gantt chart that
shows the orders or jobs in
progress and whether they are on
schedule or not.
Assignment Method of Linear
Scheduling
Programming
1. Assignment Model is a type of
linear programming model for
optimal assignment of tasks and
resources.
2. Hungarian method is the method
of assigning jobs by a one for one
matching to identify the lowest
cost solution.
Scheduling
Hungarian Method
First of all, acquire the relevant cost
information and arrange it in tabular form.
Second, obtain the Row Reduction, this is
obtained by subtracting the smallest
number in each row from every number in
the row. Enter the results in a new table.
Third, Obtain the Column Reduction by
subtracting the smallest number in each
column of the new table from every
number in the column.
Scheduling
Hungarian Method
Fourth, test whether an optimum
assignment can be made. You do this
by determining the minimum number
of lines needed to cover cross out all
zeros. If the number of lines equal
the numbers of row, an optimum
assignment is possible. IN that case
move to final step.
Scheduling
Hungarian Method
Fifth, if the numbers of lines is less
than the number of rows, modify the
table in the following manner:
• Subtract the smallest uncovered number
from every uncovered number in the table.
• Add the smallest uncovered number to the
numbers at the intersections of covering
lines.
• Numbers crossed out but not at
intersections of cross out lines carry over
unchanged to the next table.
Scheduling
Hungarian Method
Sixth, Repeat steps fourth and fifth
unless an Optimal table is obtained.
Seventh, make the assignments.
Begin with rows or columns with only
one zero. Match items that have
zeros, using only one match for each
row and each column. Cross out both
the row and column for each row.
Scheduling
Hungarian Method Example
Select the row minimum
MACHINE
JOBS A B C D ROW MIN.
1 8 6 2 4 2
2 6 7 11 10 6
3 3 5 7 6 3
4 5 10 12 9 5
Scheduling
Hungarian Method Example
Subtract the smallest number in reach row
To form a new table and select col minimum
MACHINE
JOBS A B C D
1 6 4 0 2
2 0 1 5 4
3 0 2 4 3
4 0 5 7 4
COL. 0 1 0 2
MIN.
Scheduling
Hungarian Method Example
Subtract the smallest number in reach column &
Enter the results to form a new table
MACHINE
JOBS A B C D
1 6 3 0 0
2 0 0 5 2
3 0 1 4 1
4 0 4 7 2
Scheduling
Hungarian Method Example
Determine the minimum number of lines needed to cross
Out all zeros. Here we have three lines only and rows are
4, so the solution is not optimal
MACHINE
JOBS A B C D
1 6 3 0 0
2 0 0 5 2
3 0 1 4 1
4 0 4 7 2
Scheduling
Hungarian Method Example
Subtract the smallest value that has not been crossed out
From every number that has not been crossed out (1 here)
And add this to numbers that are at intersections of
covering lines
MACHINE
JOBS A B C D
1 6+1= 3 0 0
7
2 0+1= 0 5 2
1
3 0 0 3 0
4 0 3 6 1
Scheduling
Hungarian Method Example
Make the assignments, start with rows and columns with
Only one 0. Match jobs with machines that have 0 costs.
MACHINE
JOBS A B C D
1 7 3 0 0
2 1 0 5 2
3 0 0 3 0
4 0 3 6 1
A4, 2B,1C and 3D
Scheduling
Sequencing
Sequencing: Determine the order
in which jobs at a work center will
be processed.
Workstation: An area where one
person works, usually with special
equipment, on a specialized job.
Scheduling
Sequencing
Job time: Time needed for
setup and processing of a job.
Priority rules: Simple heuristics
( Commonsense rules) used to select the
order in which jobs will be processed.
• Local Rules ( pertaining to single workstation).
• Global Rules( pertaining to multiple
workstation).
• Job processing times and due dates are
important pieces of information.
• Job time consists of processing time and setup
times.
