Scheduling
Scheduling
Introduction
You need to fry 3 pieces of fish in exactly 15 min Each side of fish requires 5 min But you are given a frying pan which can only load 2 pieces of fish at a time
Short-Term Scheduling
Deals with timing of operations Short run focus: hourly, daily, weekly Types
Forward Scheduling Backward Scheduling
B
Today
E
Due Date Today
E
Due Date
4
University
Instructors Classrooms
Factory
Production Purchases
1984-1994 T/Maker Co.
Forward Scheduling
Forward scheduling: begins the schedule as soon as the requirements are known
jobs performed to customer order schedule can be accomplished even if due date is missed often causes buildup of WIP
Backward Scheduling
Backward scheduling: begins with the due date of the final operation; schedules jobs in reverse order
used in many manufacturing environments, catering, scheduling surgery
Long-term
Intermediate-term
Intermediate-term
Short-term
8
Quantitative criteria
Average completion time Utilization (% of time facility is used) WIP inventory (average # jobs in system) Customer waiting time (average lateness)
10
Variety of Methods
Low-Volume Systems
High variety, low volume systems Products made to order Products need different materials and processing Complex production planning and control Production planning aspects
Shop loading Job sequencing
13
Approaches
Gantt charts (load & scheduling) - capacity Assignment method - job to specific work center
14
M
Job A
T
Job D
Th
Job F Job G Job H
Job B Job C
Job E
Job I
15
Day T W T
Job A
Job B
Repair
Job C
Today
16
Assignment Method
Assigns tasks or jobs to resources Type of linear programming model Objective
Minimize total cost, time etc.
Constraints
1 job per resource (e.g., machine) 1 resource (e.g., machine) per job
17
Ex. Ravi Behara, the managing partner at a large law firm in Virginia, must assign three clients to three attorneys. Cost data are presented below: Use the assignment algorithm to solve this problem.
Attorney
Client
Divorce Felony Discrimi nation
1
$800 $500 $500
2
$1,100 $1,600 $1,000
3
$1,200 $1,300 $2,300
18
3. TARDINESS the amount by which completion time exceeds due date of jobs
Obj.: minimize no. of tardy jobs, minimize the maximum tardiness
19
Sequencing
Specifies order of jobs that will be worked Sequencing rules
First come, first served (FCFS) Shortest processing time (SPT) Earliest due date (EDD) Longest processing time (LPT) Critical ratio (CR) Johnsons rule
20
First come, first served The first job to arrive at a work center is processed first Earliest due date The job with the earliest due date is processed first Shortest processing time The job with the shortest processing time is processed first
Longest processing time The job with the longest processing time is processed first Critical ratio The ratio of time remaining to required work time remaining is calculated, and jobs are scheduled in order of increasing ratio.
21
22
23
Johnsons Rule
Used to sequence N jobs through 2 machines in the same order
Jobs (N = 3) Saw Drill
27
Example
Consider the ffg. jobs and their processing times at corresponding machines: Job M1 M2 M3 A 13 5 9 B 5 3 7 C 6 4 5 D 7 2 6
30
Figure 15.5
32
33
Example
A softdrink manufacturer bottles six flavors on a single machine. Relevant data are given:
See whiteboard
Using the smallest run-out time rule, which flavor should be produced first? What will be the resulting inventory levels? Assume 3 shifts per day.
34
Determinants of success:
process and product design, preventive maintenance, rapid repair when breakdown occurs, optimal product mixes, minimization of quality problems, & reliability and timing of supplies.
36
37