Scribd
Upload
146 views30 pages

Workcentre Scheduling

Workcentre Scheduling for Johnson rule like n jobs in n machines. Also, n jobs in 1 machine scheduling is also calculated in the article.

Uploaded by

rohitgoyal207
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
146 views30 pages

Workcentre Scheduling

Workcentre Scheduling for Johnson rule like n jobs in n machines. Also, n jobs in 1 machine scheduling is also calculated in the article.

Uploaded by

rohitgoyal207
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 30

WORK CENTER SCHEDULING

McGraw-Hill/Irwin
Workcenter Scheduling
• Manufacturing execution system (MES): an information
system that schedules, dispatches, tracks, monitors, and
controls production
• Real-time linkage to:
• MRP
• Product and process planning
• Systems that extend beyond the factory

• Service execution system (SES): an information system


that links schedules, dispatches, tracks, monitors, and
controls the customer’s encounters with the service
organization
The Nature and Importance of
Work Centers
• Work center: an area in which production resources are
organized and work is completed
• May be a single machine, a group of machines, or an area where
work is done
• Can be organized according to function, product in a flow, or group
technology
• Jobs need to be routed between functionally organized
work centers to complete the work
Loading
• Infinite loading: work is assigned to a work center based
on what is needed
• No consideration to capacity
• MRP is one example
• Finite loading: schedules each resource using the setup
and run time required for each order
• Determines exactly what will be done by each resource at every
moment during the day
Scheduling
• Forward scheduling: the system takes an order and
schedules each operation that must be completed forward
in time
• Can tell the earliest date an order can be completed
• Backward scheduling: starts with due date and
schedules the required operations in reverse sequence
• Can tell when an order must be started in order to be done by a
specific date
Limitations
• Machine-limited process: equipment is the critical
resource that is scheduled
• Labor-limited process: people are the key resource that
is scheduled
• Most actual processes are either labor limited or machine
limited but not both
Types of Manufacturing Processes and
Scheduling Approaches
Typical Scheduling and Control Functions
1. Allocating orders, equipment, and personnel
2. Determining the sequence of order performance
3. Initiating performance of the scheduled work
• Commonly called dispatching
4. Shop-floor control
Objectives of Work-Center Scheduling
1. Meet due dates
2. Minimize lead time
3. Minimize setup time or cost
4. Minimize work-in-process inventory
5. Maximize machine utilization

• It is unlikely, and often undesirable, to simultaneously


satisfy all of these objectives
Job Sequencing
• Sequencing: the process of determining the job order on
machines or work centers
• Also known as priority sequencing
• Priority rules: the rules used in obtaining a job sequence
• Can be simple or complex
• Can use one or more pieces of information
• Common rules shown on next slide
Priority Rules for Job Sequencing
Standard Measures of Schedule
Performance
1. Meeting due dates
2. Minimizing the flow time
3. Minimizing work-in-process inventory
4. Minimizing idle time
Example 22.1: n Jobs on One Machine
Example 22.1: FCFS Rule
Example 22.1: SOT Rule
Example 22.1: EDD
Example 22.1: LCFS Schedule
Example 22.1: Random Schedule
Example 22.1: STR Rule
Comparison of Priority Rules
Scheduling n Jobs on Two Machines
• Two or more jobs must be processed on two machines in
a common sequence
• Wish to minimize the flow time from the beginning of the
first job to the finish of the last job
• Use Johnson’s rule
1. List the operation time for each job
2. Select the shortest operation time
3. If the shortest time is on the first machine, do first
• If the shortest time is on the second machine, do the job last
• For ties, do first
4. Repeat steps 2-3 for each remaining job
Example 22.2: n Jobs on Two Machines
Calculate total elapsed time and idle time
for each machine

A B C D E F
M1 2 5 4 3 2 1
M2 6 8 1 2 3 5

Total elapsed time -26

22-23
Calculate total elapsed time and idle time
for each machine

A B C D E
M1 5 7 6 9 5
M2 2 1 4 5 3
M3 3 7 5 6 7

22-24
Scheduling a Set Number of Jobs on the
Same Number of Machines
• Some work centers have enough machines to start all the
jobs
• Here the issue is the particular assignment of individual
jobs to individual machines
• Assignment method: a special case of the transportation
method of linear programming
1. There are n things to be distributed to n destinations
2. Each thing assigned to one and only one destination
3. Only one criterion can be used
Example 22.3: Assignment Method
Example 22.3: Optimal Solution

22-27
Another
Man
I II III IV V
A 1 3 2 3 6
Task B 2 4 3 1 5
C 5 6 3 4 6
D 3 1 4 2 2
E 1 5 6 5 4

22-28
Principles of Work Center Scheduling
1. There is a direct equivalence between work flow and
cash flow
2. The effectiveness of any job shop should be measured
by speed of flow through the shop
3. Schedule jobs as a string, with process steps back-to-
back
4. A job once started should not be interrupted
5. Speed of flow is most efficiently achieved by focusing
on bottleneck work centers and jobs

22-29
Principles of Job Shop Scheduling Continued
6. Reschedule every day
7. Obtain feedback each day on jobs that are not
completed at each work center
8. Match work center input information to what the worker
can actually do
9. When improving output, look for incompatibility between
engineering design and process execution
10. Certainty of standards, routings, and so forth is not
possible, but always work toward achieving it

22-30

You might also like