a






„



1. Assigning priority of each shop order

2. Maintaining work-in-process quantity

information

3. Conveying shop-order status information to the

office


 |p

 
 14
a






„



4. Providing actual output data for capacity control

purposes

5. Providing quantity by location by shop order for

WIP inventory and accounting purposes

6. Providing measurement of efficiency, utilization,

and productivity of manpower and machines

 |p

 
 15
 a





 

D phe shop floor control system consists of three
steps.
1.Order release.
2.Order scheduling
3.Order progress.

3

 |p

 

[ 
D phe purpose of order release is to provide the necessary
documentation that accompanies an order as it is
processed through the shop.
D phe shop packet for an order consists of :
1.Route sheet.
2.Material requisitions.
3.Job cards.
4.Move ticket.
5.Parts list.

4

 |p

 

 [a  
D phe purpose is to make assignment of the order
to the various machines in the factory.

D It is the function of priority control to schedule

the order for production according to their
priorities.

D phe basic document prepared by the order

scheduling module is dispatch list.

5

 |p

 

 [a  
D It reports the job that should be done at each work
center and certain details about the routing of the
part.

D phe dispatch list is generated each day or each

shift.

D In an effective shop floor control system,

documents represents to the foreman or production
supervisor the best way for accomplishing the
master schedule.
6

 |p

 


.
 [


D phe purpose of the order progress module is to

accomplish the remaining three function of shop
floor control;

D po provide data relative to work in progress.

D Shop order status.

D Capacity control.

·

 |p

 

 [

D phe order progress module is designed to accept data
collected from the shop floor and to generate reports that
can be assist production management.
D phe various documents contained in the shop packet
provide the means to identify the jobs.
D When a machine operator completes a particular process
specified in the root sheet, relevant data to indicate the
completion are entered into the order progress module.
D phe order progress module maintains a file of the
transactions reported on each of the uncompleted jobs.


 |p

 

 å 
 

WORK LOp PRIOR NEXp SpARp DUE REMAIN

ORDER QUANpI WORK WORK DApE DApE ING
p CENpER CENpER HOURS

1573 25 370 400 1-14 1-25 27.6

1688 300 370 400 1-14 1-28 40.5

16·2 107 265 375 1-17 1-31 13.6

16·3 14 370 342 1-17 2-4 12.0

2053 27 240 375 1-20 1-28 16.2


 |p

 
 21
 [

a  
D phe nature and importance of job shops

D Job-shop scheduling (
  

 ù

D Shop-floor control

D Issues in scheduling service personnel

2

 |p

 

   
a  

1. phere is a direct equivalence between work flow

and cash flow.
2. phe 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.

 |p

 
 18
   
a  

5. Speed of flow is most efficiently achieved by

focusing on bottleneck work centers and jobs.

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.

 |p

 
 1·
   
a  

·. When seeking improvement in output, look for

incompatibility between engineering design and
process execution.

10. Certainty of standards, routings, and so forth is

not possible in a job shop, but always work
towards achieving it.


 |p

 
 20
 Priority Rules for Job Sequencing

1. First-come, first-served (FCFSù

2. Shortest operating time

3. Earliest due date first

4. Earliest start date first (due date-lead timeù

5. Least slack time remaining first

7

 |p

 

 Priority Rules for Job Sequencing

6. Least slack time remaining (per operation as

opposed to per jobù first
7. Smallest critical ratio first
(due date-current dateù (number of days remainingù

8. Smallest queue ratio first

(slack time remaining in scheduleù (planned remaining queue timeù

·. Last come, first served

10. Random order
8

 |p

 

 Job Sequencing Example

  
   
 
       

          Orders submitted
ë
at beginning of week
  
  


  


F FS Schedule
 
  
  
    
 


           
ë 4 5 4 ü

B 7 10 11
3 6 14
 
1 4 15


 |p

 
 10
 Job Sequencing Example
ü   
   
 
       

          Orders submitted
ë
at beginning of week
  
  


  


Last-Come First-Served Schedule

 
  
  
    
 


           
å 1 4 1 ü

3 6 4  
B 7 10 11
ë 4 5 15


 |p

 
 12
 Job Sequencing Example
   


 
       

          Orders submitted
ë
at beginning of week
  
  


  


Shortest Operating pime Schedule

 
       
    
           
 
ü

    
ë
8
   


 |p

 
 11
 Job Sequencing Example
* 
   

 
       

          Orders submitted
ë
at beginning of week
  
  


  


Earliest ue ate First

 
       
    
           
  ü

ë

 
   8
   


 |p

 
 13