Documente Academic
Documente Profesional
Documente Cultură
Krishna Murari
Scheduling
Scheduling is process of setting up operations processing time so that job is completed by the time they are due. The main objective of scheduling to provide the best service to the customer through efficient use of resources.
Purpose of Scheduling
To help the firm to maximise customer satisfaction To Minimize service delays To Enable the firm to allocate the capacity to meet customers demands on time. To reduce cost and maximise profit To create flexibility to accommodate variation in customer demand
Work Center
A work center is an area in a business in which productive resources are organized and work is completed Can be a single machine, a group of machines, or an area where a particular type of work is done
Scheduling Methods
Infinite loading : jobs are assigned to work centers without regard to the work centers capacity as if its capacity is infinite. Gantt load charts and visual load profiles and assignment algorithm are used to evaluate loading and assigning the jobs. Finite loading : A scheduling procedure that assigns jobs into work centers and dermines their starting and completion dates by considering the work centers capacity. Work centers capacity is allocated unit by unit by simulating job starting and completion time.
Selection of scheduling method depends on volume of production, capacity of work center and nature of operations
Scheduling Methods
Forward scheduling : Determining the start and finish times for the waiting jobs by assigning them to the earliest available time slots at the work centre. (Used in job shops). Forward scheduling is simple in use and it gets job done in shortest lead time but has excessive inventory as jobs get accumulated at various work centers as they get completed before the availability of next work center. Backward scheduling : Determining the start and finish times for the waiting jobs by assigning them to the latest available time slots at the work centre to enable to complete each job just when it is due. (Used in assy). It minimizes the inventory since job is not completed till it must go to next work center on its routing.
Scheduling Methods
2 jobs are to be processed on 2 machines. The route sheets is given below. Both jobs should be ready in 8 hours. Develop schedule using forward and backward scheduling. Job X route Sheet Job Y route sheet
Routing Machine sequence 1 2 3 Total 1 2 1 Processing Routing Machine Processing Time Hrs sequence Time Hrs 2 3 1 6 5 1 2 1 2 2 3
Scheduling Methods
Forward Scheduling
8
7 6 5 4 3 2 1 Y1 X1 X3
Y2
X2
Scheduling Methods
Backward Scheduling
Job X route Sheet
Routing sequence 1 2 3 Total Machine 1 2 1 Processing Time Hrs 2 3 1 6 5
Scheduling Methods
Backward Scheduling
8 X3 Y2
7 6 5 4 3 2 1 X1 Y1 Y2 X2
Typical Scheduling and Control Functions Allocating orders, equipment, and personnel Determining the sequence of order performance Initiating performance of the scheduled work Shop-floor control
Meet due dates Minimize lead time Minimize setup time or cost Minimize work-in-process inventory Maximize machine utilization
Scheduling Activities
Routing : it is specifications of work flow. It explains the sequence of operations and processes to be followed in order to produce a particular product. It defines the what to do and where and how to do. Route sheets give these details. Loading : It is assigning specific job to each work centre for planned period. For loading capacity limitation of each machine is to be considered. Dispatching : It is the final act of releasing the job orders to the worker to go ahead with the production process. In this, operation manager releases the job orders as per the planned sequence and then controls the process for effective implementation of schedule. Dispatching rules called as priority rules are used in scheduling the production activities.
2.
3. Earliest due date first (DDate) : The jobs are prioritized according to their earliest due dates. Dispatching is done in such a way that the one with earliest due date is dispatched first, the next earliest next and so on.
5.
difference between the due date and the current date by the work remaining. Order with the smallest CR are run first.
Do all the jobs get done on time? Do all the jobs get done on time? No, Jobs B, C, No, Jobs B, C, and D are and D are going to be late going to be late
Do all the jobs get done on time? Do all the jobs get done on time?
Do all the jobs get done on time? Do all the jobs get done on time?
No, Jobs C No, Jobs C and B are and B are going to be going to be late late
Delay D-0, A-0, C-2 and B -5 days
CR =
Jobs (in order Processing Due Date of arrival) Tim e (days) (days hence) A 4 5 B 7 10 C 3 6 D 1 4
Do all the jobs get done on time? Do all the jobs get done on time?
In order to do this schedule the CRs have be calculated for each job. If we let today be Day 1 and allow a total of 15 days to do the work. The resulting CRs and order schedule are: CR(A)=(5-4)/15=0.06 (Do this job first) CR(B)=(10-7)/15=0.20 (Do this job second, tied with C and D) CR(C)=(6-3)/15=0.20 (Do this job second, tied with B and D) CR(D)=(4-1)/15=0.20 (Do this job second, tied with B and C)
No, but since No, but since there is a there is a three-way tie, three-way tie, only the first only the first job or two will job or two will be on time be on time
Jobs (in order Processing Due Date of arrival) Time (days) (days hence) A 4 5 B 7 10 C 3 6 D 1 4
Do all the jobs get done on time? Do all the jobs get done on time?
No, Jobs B No, Jobs B and A are and A are going to be going to be late late
Delay D-0, C-0, B-1 and A -10 days
Jobs (in order Processing Due Date of arrival) Time (days) (days hence) A 4 5 B 7 10 C 3 6 D 1 4
Do all the jobs get done on time? Do all the jobs get done on time?
Time Flow 4 5 8 15
No, Jobs D,C No, Jobs D,C and B are and B are going to be going to be late late
Delay A-0, D-1, C-2 and B-5 days
Scheduling Techniques
Many
Gantt Charts
It was developed by Henry L. Gantt. It is a graphical display of the duration of a set of activities. Gantt chart: Used as a tool to monitor the progress
of work and to view the load on workstations.
The chart takes two basic forms: (1) the job or activity progress chart, and (2) the workstation chart.
The Gantt progress chart graphically displays the current status of each job or activity relative to its scheduled completion date. The Gantt workstation chart shows the load on the workstations and the nonproductive time.
4/11
5/11
Pontiac
Drop D out, select the next smallest time (Job A), and place it 4th in the job sequence as it is at stage 2
Drop A out, select the next smallest time. There is a tie in two stages for two different jobs. In this case, place the job with the smallest time in the first stage as early as possible in the unfilled job sequence. Then place the job with the smallest time in the second stage as late as possible in the unfilled sequence. Job Sequence 1 Job Assigned D 2 B 3 C 4 A
Problem
: A firm produces six type of shoes pairs and manufacturing of shoes pairs require processing on two machines A and B. The processing time for each shoe pair on both machines (in Hrs) are given below: Shoe pair type Machine A Machine B 1 35 75 2 105 100 3 55 95 4 25 65 5 95 35 6 105 20
Determine an optimum sequence so that the total elapse time is minimum. Also calculate idle time on machine A and Machine B
Solution:
stage:1
Least processing time is 20 for job 6 at machine B hence it will come at the end of sequence i.e. at 6th place
Shoe pair type Machine A Machine B 6 105 20
Solution:
stage 2
Next least process time is 25 hrs for shoe pair type 4 on machine A hence it will be placed at the beginning of sequence
Shoe pair type Machine A Machine B 4 25 60 6 105 20
Solution:
stage: 3
Next least process time is 30 hrs for shoe pair type 1 on machine A and 30 hrs for type 5 pair on machine B so type 1 is scheduled nest to type 4 on machine A and type 5 shoe pair before type 6 pairs shown below Shoe pair type Machine A Machine B 4 25 65 1 35 75 5 95 35 6 105 20
Solution:
stage: 4
Next least process time is 55 hrs for shoe pair type 3 on machine , hence it will be sequenced after shoe pair 1 Shoe pair type Machine A Machine B 4 25 65 1 35 75 3 55 95 5 95 35 6 105 20
Solution:
stage:5
last left our pair 2 will be sequenced after pair 3 Shoe pair type Machine A Machine B 4 25 65 1 35 75 3 55 95 2 105 100 5 95 35 6 105 20
Solution:
Job sequence Machine A
stage:6
Machine B
Now we develop the schedule of each job in optimum sequence as shown below
Time in Processi Time out Time in Processi Time out ng time ng time 0 25 60 115 220 315 25 35 55 105 95 105 25 60 115 220 315 420 25 90 165 260 360 420 65 75 95 100 35 20 90 165 260 360 395 440
4 1 3 2 5 6
Note : Time- in for machine will be time-out of the job from machine A or time-out of previous job from machine B which ever is bigger
Solution:
stage:7
We can calculate elapse time and idle time as follows Total elapse time : 440 hours Idle time for machine A = 440-420 = 20 hrs Idle time for machine B = Time taken by machine A to complete first job 25 hrs + [ (90-90)+(165-165) + (260260) +(360-360) + (420-395)] = 50 hrs.
12 31 47 68 86
17 43 61 77 96
Total operation time with optimum sequence is 104 hrs Idle time on machine A = 104 -86 =14 hrs. Idle time on machine B= 12 + [ (31-17)+ (47-43)+ (6853) + (77-86) + (104 -96) ]= 62 hrs. Idle time on machine C = 17 +[ (43-33)+ (61-61)+ (7775) +(96-87) = 38 hrs.
Determine the optimum sequence , elapse time and idle time on each machine
Total operation time with optimum sequence is 55 hrs Idle time on machine P = 55-39 =16 hrs. Idle time on machine Q = 10+(22-17)+(31-30)+(3937)+(55-43) = 30 hrs. Idle time on machine R = 17+(30-22)+(37-33)+(4341)+(55-45)= 41 hrs Idle time on machine S =22+(33-31)+(42-42)+(4949)=24hrs
Two operations:
Scheduling consecutive days off 5 days week working Scheduling daily work times Scheduling hourly work times
Reservation system like hotel rooms Strategic product pricing to adjust the shift in
demand like higher price at peak hours electricity at high price summer