【正文】
Copyright 2021 John Wiley amp。 Sons, Inc. Beni Asllani University of Tennessee at Chattanooga Scheduling Operations Management 5th Edition Chapter 16 Roberta Russell amp。 Bernard W. Taylor, III Copyright 2021 John Wiley amp。 Sons, Inc. 162 Lecture Outline ? Objectives in Scheduling ? Loading ? Sequencing ? Monitoring ? Advanced Planning and Scheduling Systems ? Theory of Constraints ? Employee Scheduling Copyright 2021 John Wiley amp。 Sons, Inc. 163 What is Scheduling? ? Last stage of planning before production occurs ? Specifies when labor, equipment, facilities are needed to produce a product or provide a service Copyright 2021 John Wiley amp。 Sons, Inc. 164 Scheduled Operations ? Process Industry ? Linear programming ? EOQ with noninstantaneous replenishment ? Mass Production ? Assembly line balancing ? Project ? Project scheduling techniques (PERT, CPM) ? Batch Production ? Aggregate planning ? Master scheduling ? Material requirements planning (MRP) ? Capacity requirements planning (CRP) Copyright 2021 John Wiley amp。 Sons, Inc. 165 Objectives in Scheduling ? Meet customer due dates ? Minimize job lateness ? Minimize response time ? Minimize pletion time ? Minimize time in the system ? Minimize overtime ? Maximize machine or labor utilization ? Minimize idle time ? Minimize workinprocess inventory Copyright 2021 John Wiley amp。 Sons, Inc. 166 Shop Floor Control ? Loading ? Check availability of material, machines and labor ? Sequencing ? Release work orders to shop and issue dispatch lists for individual machines ? Monitoring ? Maintain progress reports on each job until it is plete Copyright 2021 John Wiley amp。 Sons, Inc. 167 Loading ? Process of assigning work to limited resources ? Perform work on most efficient resources ? Use assignment method of linear programming to determine allocation Copyright 2021 John Wiley amp。 Sons, Inc. 168 Assignment Method 1. Perform row reductions ? subtract minimum value in each row from all other row values 2. Perform column reductions ? subtract minimum value in each column from all other column values 3. Cross out all zeros in matrix ?use minimum number of horizontal and vertical lines 4. If number of lines equals number of rows in matrix then optimum solution has been found. Make assignments where zeros appear 5. Else modify matrix ? subtract minimum uncrossed value from all uncrossed values ? add it to all cells where two lines intersect ? other values in matrix remain unchanged 6. Repeat steps 3 through 5 until optimum solution is reached Copyright 2021 John Wiley amp。 Sons, Inc. 169 Assignment Method: Example Row reduction Column reduction Cover all zeros 5 0 1 5 3 0 1 4 3 0 1 4 4 0 2 4 2 0 2 3 2 0 2 3 2 1 0 1 0 1 0 0 0 1 0 0