Scheduling

1 st year / 2014-2015/ Principles of Industrial Eng. Chapter -3 -/ Dr. May G.
Kassir
Chapter Three
Scheduling, Sequencing and Dispatching
3-1- SCHEDULING
Scheduling can be defined as prescribing of when and where each operation
necessary to manufacture the product is to be performed. It is also defined as
establishing of times at which to begin and complete each event or
operation comprising a procedure. The principle aim of scheduling is to plan
the sequence of work so that production can be systematically arranged towards
the end of completion of all products by due date.
3-1-1- Principles of Scheduling
1. The principle of optimum task size: Scheduling tends to achieve maximum
efficiency when the task sizes are small, and all tasks of same order of
magnitude.
2. Principle of optimum production plan: The planning should be such that it
imposes an equal load on all plants.
3. Principle of optimum sequence: Scheduling tends to achieve the maximum
efficiency when the work is planned so that work hours are normally used in the
same sequence.
3-1-2-Inputs to Scheduling
1. Performance standards: The information regarding the performance standards
(standard times for operations) helps to know the capacity in order to assign
required machine hours to the facility.
2. Units in which loading and scheduling is to be expressed.
1
1 st year / 2014-2015/ Principles of Industrial Eng. Chapter -3 -/ Dr. May G. Kassir
3. Effective capacity of the work centre.

4. Demand pattern and extent of flexibility to be provided for rush orders.
5. Overlapping of operations.
6. Individual job schedules.
3-1-3- Techniques of Scheduling

(a) Master Scheduling (MS): It shows the dates on which important production
items are to be completed. Its a weekly or monthly break-up of the production
requirements for each product. Whenever any order is received, it is
accommodated first in the MS considering the availability of the machine and
labor. It helps production manager for advance planning & to have check over the
production rate and efficiency. See table 3-1.
Table (3-1) Aggregate plan and master schedule for electric motors
( b) Shop Manufacturing Schedule: After preparing the MS, shops schedules

(SS) are prepared. It assigns a definite period of time to a particular shop for
manufacturing products in required quantity. It shows how many products are to
be made, and on what day or week.
( c) Backward or Reverse Scheduling: External due date considerations will
directly influence activity scheduling in certain structures. The approach adopted
in scheduling activities in such cases will often involve a form of reverse
scheduling with the use of bar or Gantt charts. A major problem with such
reverse or due date scheduling is in estimating the total time to be allowed for
each operation, in particular the time to be allowed for waiting or queuing at
facilities. Some queuing of jobs (whether items or customers) before facilities is
often desirable since, where processing times on facilities are uncertain, high
utilization is achieved only by the provision of such queues.
Operation times are often available, but queuing times are rarely known
initially, the only realistic way in which queuing allowances can be obtained is
by experience. Experienced planners will schedule operations, making
allowances which they know from past performances to be correct. Such
allowances may vary from 50 per cent to 2000 per cent of operation times and
can be obtained empirically or by analysis of the progress of previous jobs. It is
normally sufficient to obtain and use allowances for groups of similar facilities
or for particular departments, since delays depend not so much on the nature of
the job, as on the amount of work passing through the departments and the
nature of the facilities.
Operations schedules of this type are usually depicted on Gantt or bar charts,
see Fig.( 3-1). The advantage of this type of presentation is that the load on any
3
facility or any department is clear at a glance, and available or spare capacity is

easily identified. The major disadvantage is that the dependencies between
operations are not shown and, consequently, any readjustment of such schedules
necessitates reference back to operation planning documents. Notice that, in
scheduling the processing of items, total throughput time can be minimized by
the batching of similar items to save set-up time, inspection time, etc.
Fig.( 3-1) Gantt Charts: A- Sample load chart / B- Sample progress chart
( d) Forward Scheduling:
For a manufacturing or supply organization a
forward scheduling procedure will in fact be the opposite of that described

above. This approach will be particularly relevant where scheduling is
undertaken on an internally oriented basis and the objective is to determine the
date or times for subsequent activities, given the times for an earlier activity, e.g.
a starting time. In the case of supply or transport organizations, the objective
will be to schedule forward from a given start date, where that start date will
often be the customer due date, e.g. the date at which the customer arrives into
4
the system. In these circumstances, therefore, forward scheduling will be an

appropriate method for dealing with externally oriented scheduling activities.
( e) Optimized Production Technique (OPT): It is a program help to recognizes
the existence of bottlenecks through which the flow gets restricted. It consists of
modules that contain data on products, customer orders, work center capacities,
etc., as well as algorithms to do the actual scheduling. A key feature of the program
is to simulate the load on the system, identify bottleneck (as well as other)
operations, and develop alternative production schedule.
Example 3-1 : A job is due to be delivered at the end of 12th week. It requires a
lead time of 2 weeks for material acquisition, 1 week of run time for operation-1, 2
weeks for operation-2, and 1 week for final assembly. Allow 1 week of transit time
prior to each operation. Illustrate the completion schedule under ( a) forward, and
(b ) backward scheduling methods.
Solution: the solution is illustrated in fig. (3-2):
Figure (3-1) Forward and Backward Scheduling.
3-2- SEQUENCING AND DISPATCHING PHASE

Sequencing activities are closely identified with detailed scheduling, as they
specify the order in which jobs are to be processed at the various work centers.
Dispatching is concerned with starting the processes. It gives necessary authority
to start a particular work, which has already been planned under routing and
scheduling. For starting the work, essential orders and instructions are given.
Therefore, the definition of dispatching is release of orders and instructions for
starting of the production for an item in accordance with the route sheet and
schedule charts.
3-2-1- Dispatching functions include:

1. Implementing the schedule in a manner that retains any order priorities
assigned at the planning phase.
2. Moving the required materials from stores to the machines, and from
operation to operation.
3. Authorizing people to take work in hand as per schedule
4. Distributing machine loading and schedule charts, route sheet, and other
instructions and forms.
5. Issuing inspection orders, stating the type of inspection at various stages.
6. Ordering tool-section to issue tools, jigs and fixtures.
3-2-2- Dispatching or Priority Decision Rules

Job shops generally have many jobs waiting to be processed. The principal
method of job dispatching is by means of priority rules, which are simplified
guidelines (heuristics) to determine the sequence in which jobs will be processed.
The use of priority rule dispatching is an attempt to formalize the decisions of the
experienced human dispatcher.
6
Some of the rules used job assignment are: first come, first served (FCFS), earliest
due date (EDD), longest processing time (LPT), and preferred customer order
(PCO). These rules can be classified as: Static or Dynamic.
Static rules do not incorporate an updating feature. They have priority indices that
stay constant as jobs travel through the plant, where as dynamic rules change with
time and queue characteristics.
Table 3-2. Priority Rules
3-3- JOHNSONS PROBLEM

For a problem with 2 machines and n jobs, Johnson had developed a polynomial
algorithm to get optimal solution, i.e., in a definite time, one can get the optimal
solution. Consider the following flow shop problem:
In the table below, t ij represents the processing time of the job i on the machine j.
3-3- 1-Johnsons Algorithm

Step 1: Find the minimum among various ti1 and ti2.
Step 2a : If the minimum processing time requires machine 1, place the associated
job in the first available position in sequence. Go to Step 3.
Step 2b : If the minimum processing time requires machine 2, place the associated
job in the last available position in sequence. Go to Step 3.
Step 3: Remove the assigned job from consideration and return to Step 1 until all
positions in sequence are filled.
The above algorithm is illustrated using the following problem:
Example 3-2: Consider the following two machines and six jobs flow shopscheduling problem. Using Johnsons algorithm, obtain the optimal sequence,
which will minimize the makespan.
The optimal sequence is 2-5-3-6-1-4. The makespan is determined as shown

below.
8
Example3-3: Consider the following 3 machines and 5 jobs flow shop problem:
Solution: we can extend the Johnsons algorithm to this problem. So the modified
problem may be given as follows:
The optimal sequence for the above problem: 3-2-5-1-4

Scheduling

Uploaded by

Copyright:

Available Formats

Scheduling

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Scheduling

Uploaded by

Copyright:

Available Formats

1 st year / 2014-2015/ Principles of Industrial Eng. Chapter -3 -/ Dr. May G.

1 st year / 2014-2015/ Principles of Industrial Eng. Chapter -3 -/ Dr. May G. Kassir

3. Effective capacity of the work centre.

3-1-3- Techniques of Scheduling

1 st year / 2014-2015/ Principles of Industrial Eng. Chapter -3 -/ Dr. May G. Kassir

( b) Shop Manufacturing Schedule: After preparing the MS, shops schedules

1 st year / 2014-2015/ Principles of Industrial Eng. Chapter -3 -/ Dr. May G. Kassir

facility or any department is clear at a glance, and available or spare capacity is

For a manufacturing or supply organization a

forward scheduling procedure will in fact be the opposite of that described

1 st year / 2014-2015/ Principles of Industrial Eng. Chapter -3 -/ Dr. May G. Kassir

the system. In these circumstances, therefore, forward scheduling will be an

Figure (3-1) Forward and Backward Scheduling.

1 st year / 2014-2015/ Principles of Industrial Eng. Chapter -3 -/ Dr. May G. Kassir

3-2- SEQUENCING AND DISPATCHING PHASE

3-2-1- Dispatching functions include:

3-2-2- Dispatching or Priority Decision Rules

1 st year / 2014-2015/ Principles of Industrial Eng. Chapter -3 -/ Dr. May G. Kassir

3-3- JOHNSONS PROBLEM

1 st year / 2014-2015/ Principles of Industrial Eng. Chapter -3 -/ Dr. May G. Kassir

3-3- 1-Johnsons Algorithm

The optimal sequence is 2-5-3-6-1-4. The makespan is determined as shown

1 st year / 2014-2015/ Principles of Industrial Eng. Chapter -3 -/ Dr. May G. Kassir

The optimal sequence for the above problem: 3-2-5-1-4

You might also like