Work Center Scheduling
Download as PPTX, PDF3 likes6,425 views
This document discusses workcenter scheduling and related topics. It introduces workcenter scheduling and its objectives like meeting due dates, minimizing lead times and setup times. It also discusses job sequencing rules like first come first serve, shortest processing time and earliest due date. Methods for scheduling jobs on 1, 2 and multiple machines are presented, including Johnson's rule and assignment method. Finally, it briefly covers personnel scheduling in services, like deriving staffing plans and applying the first hour principle.
Work Center Scheduling
- 1. Workcenter Scheduling Presented By: Shivangi Singh Shivani Gautam Shivangi Arora
- 2. INTRODUCTION A schedule is a timetable for performing activities, utilizing resources, or allocating facilities. Manufacturing Execution Systems (MES): Is an information system that schedules, dispatches, tracks, monitors, and controls production on the factory floor. A WorkCentre is an area in a business in which productive resources are organized and work is completed. Objectives of Work center scheduling I. Meet due dates. II. Minimize lead time. III. Minimize setup time. IV. Minimize work in process inventory. V. Maximize machine or labor utilization
- 3. Related study Title: Comprehensive Review of the Dispatching, Scheduling and Routing of AGVs. Abstract: Automated Guided Vehicle System (AGVS) has become an important strategic tool for automated warehouses. AGVs are widely used to transport materials between workstations in flexible manufacturing systems and perform a variety of tasks that involve automation in industrial environments. If all the requirements are carried out as per the needs of the productive system, the control system is a viable option for the increase in enterprise competitiveness.
- 4. 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 1. FCFS : orders are run in the order they arrive. 2. SOT : Run the job with the shortest completion time first, next shortest second and so on. Also referred as SPT. 3. EDD : Run the job with the earliest due date first. 4. STR : Time remaining before due date — remaining processing time. 5. LCFS : As orders arrives, they are placed on the top of the stack; the operator usually picks up the order on top to run first. 6. Random: In this the supervisor usually select whichever job they feel like running.
- 5. Example for scheduling n job on 1 machines:
- 6. Scheduling n job on 2 machines: In this we use Johnson’s rule. Steps to Johnson’s Rule I. List the operation time for each job. II. Select the shortest operation time. III. 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. Repeat steps 2-3 for each remaining job.
- 7. Scheduling n job on m machines: Assignment method: a special case of the transportation method of linear programming. Steps for Assignment method: 1. Subtract the smallest number in each row or column from itself and all other numbers in that row or column. 2. Now, determine the minimum number of lines required to cover each zero. 3. Subtract minimum number i.e. uncovered from all the uncovered values and add the minimum number to the numbers that lie at the intersection. 4. Now make job assignments.
- 8. Personnel scheduling in services Scheduling daily work times: It’s basically about deriving a staffing plan 1. Requires the fewest workers to accomplish the daily workload. 2. Minimizes the variance between actual and planned output. Scheduling hourly work times: This kind of personnel scheduling situation can be approached by applying a simple rule, the “first-hour” principle. The first hour rule implies that for the first hour, we assign a number of workers equal to the requirement in that period.