Professional Documents
Culture Documents
Mams 06
Mams 06
SCHEDULING
E. Gutierrez-Miravete Spring 2001
PROCESS LAYOUT
FLOW SHOP (jobs go through same sequence) JOB SHOP (each job has its own route)
CELLULAR LAYOUT
THROUGHPUT TIME THE TIME BETWEEN WHEN THE JOB IS RELEASED TO THE SHOP AND WHEN IT IS COMPLETED AND READY FOR DELIVERY
COMPONENTS OF THROUGHPUT TIME PROCESSING TIME SETUP TIME MATERIAL HANDLING TIME WAITING TIME
KEY QUESTIONS
WHEN TO RELEASE ORDERS TO THE PRODUCTION FACILITY? HOW TO SEQUENCE JOBS AT A SINGLE WORKSTATION? HOW TO SCHEDULE JOBS THROUGH THE ENTIRE FACILITY?
ORDER RELEASE
BASIC PROBLEM: FROM A LIST OF PENDING ORDERS SELECT THE TIME TO BEGIN PROCESSING SHOP MANAGERS GOAL: KEEP ALL MACHINES BUSY SALES DEPARTMENT GOAL: TO MEET ALL CUSTOMER DUE DATES USE AVERAGE STATION DELAY TIME
pij
wj
mj
THROUGHPUT TIME
PRUDENT MANAGER WOULD RELEASE THE JOB EARLIER! (What is the likely consequence of this?)
COMMON TOOL FOR CONTROLLING WORK LOADS --> LOAD REPORTS (See Fig. 4.3 and Example 4.2)
BOTTLENECKS
WORKCENTER WITH THE HIGHEST UTILIZATION UTILIZATION = PROCESSING TIME/AVAILABLE TIME BOTTLENECK SCHEDULING GOAL: TO MAXIMIZE THE PRODUCTIVE UTILIZATION OF BOTTLENECKS
UTILIZATION
FOR PART i AND WORKCENTER m DEMAND OF i Di SCHEDULABLE TIME Pm LOAD PROFILE pim UTILIZATION um
um = 7 pimDi/ Pm
UTILIZATION (contd)
Where are the largest utilizations? What is the consequence of having a workcenter with utilization greater than 1? Who is the bottleneck if all utilizations are less than 1? Why it may be desirable to accumulate significant WIP in front of the bottleneck?
Q2 = 2 A D /h
SCHEDULING: PROCESS OF
ADDING START AND FINISH TIME TO THE PROCESS DICTATED BY THE SEQUENCE
DEFINITIONS
PROBLEM VARIABLES
NUMBER OF JOBS SCHEDULED (N) NUMBER OF MACHINES (M) DUE DATE OF JOB i (di) SETUP AND PROCESSING TIME OF JOB i IN MACHINE j (pij)
DEFINITIONS
SOLUTION DEPENDENT MEASURES
TIME FOR COMPLETING JOB i
(Ci)
LATENESS (Li
Cmax
TYPICAL OBJECTIVES
MINIMIZE AVERAGE FLOW TIME MINIMIZE MAKESPAN MINIMIZE AVERAGE TARDINESS MINIMIZE MAXIMUM TARDINESS MINIMIZE NUMBER OF TARDY JOBS
NOTATION
SCHEDULING N JOBS IN M MACHINES ACCORDING TO JOB FLOW PATTERN A AND PERFORMANCE MEASURE B
N/M/A/B
EXAMPLE: MINIMIZE AVERAGE FLOW TIME WITH ARBITRARY FLOW PATTERN G --> N/M/G/Fave
PERMUTATION SCHEDULE
ALL JOBS VISIT MACHINES IN SAME SEQUENCE ALL MACHINES PROCESS JOBS IN THE SAME ORDER Example 4.3 and Fig. 4.5
GANTT CHARTS
DISPATCHING RULES
DISPATCHING: SELECTING OF A JOB
FROM INPUT QUEUE FOR PROCESSING WHEN PROCESSOR BECOMES AVAILABLE
STANDARD DISPATCHING RULES STATIC RULES VS. DYNAMIC RULES SLACK BASED RULES MYOPIC VS GLOBAL RULES Table 4.7 (p. 115); Example 4.10
SCHEDULE GENERATION
FULLY ACTIVE SCHEDULE: NEVER MAKE A JOB WAIT IN QUEUE WHEN IT CAN BE COMPLETED BEFORE THE NEXT JOB IS SCHEDULED TO START NONDELAY SCHEDULE: MACHINE IS NEVER IDLE WHEN ITS QUEUE IS NON-EMPTY Table 4.9 (p. 117) and Fig. 4.9