Академический Документы
Профессиональный Документы
Культура Документы
This paper introduces you to the basic concepts of operations-scheduling. We will discuss few dynamic scheduling algorithms and introduce you to a unique bottle neck scheduling algorithm commonly used in the semiconductor industry. We would wrap our discussion with an interesting example of the video download servicesion with an interesting example of the video download serviceThis paper introduces you to the basic concepts of operations-scheduling. We will discuss few dynamic scheduling algorithms and introduce you to a unique bottle neck scheduling algorithm commonly used in the semiconductor industry. We would wrap our discus
For our discussion today, we would be concentrating only on the short term scheduling process. Short term scheduling is generally done a daily basis. The basic goals of short term scheduling are as follows: 1) 2) 3) 4) Minimize Completion Time Maximize utilization Minimize Work In progress Inventory Minimize Customer Wait Time
A typical scheduling algorithm would aim to make effective use of labor and machinery to achieve maximize utilization.
Among the common scheduling algorithms we have the First Come First Basis, Shortest Job First, Scheduling based on Slack time remaining (STR), and Critical Ratio (CR) etc. A vast majority of scheduling research efforts have concentrated on the development of workable predictive baseline schedules, assuming complete information and a static and deterministic environment. During execution, however, a project may be subject to numerous schedule disruptions. We present you with an algorithm that tries to cope up with these disruptions. Predictive (or proactive) Scheduling algorithm is a robust technique as it incorporates a safety time to incorporate safety time to absorb anticipated disruptions with a reactive procedure that is invoked when a schedule breakage occurs during project execution. Predictive Reactive scheduling The approach is a two-step process. In the first step, a set of schedules is built to follow a partial order. The flexibility introduced in step one is then used on-line to propose to the decision-maker a set of alternative when necessary. It starts with a set of flexible schedules that is released for execution. In the next step, if need be, a reactive algorithm is used, to adapt the original solutions to the shop floor reality. However in reality, unexpected events like machine breakdowns, material availability, etc. can make render the predictive schedule unfeasible or lead to a poor performing schedule. A set of schedules, therefore, takes care of this limitation. This takes care of having some flexibility in job sequencing. A desired range of performance values is accounted by the partial order computation. It can also be subject to technological constraints, company's preferences and other possible disruptions. A time window and the type of the schedules chosen provide temporal flexibility. In semi-active schedules, jobs cannot be scheduled to start earlier without changing any of job sequence, precedence constraints or release dates. Semi-active schedules allow the presence of idle times between the jobs. Thus, it would be possible to execute a job in a time window larger than its processing time allowing temporal flexibility.
Cyclic Scheduling In cyclic scheduling, a set of tasks is to be repeated many times (assumed infinite). These have periodic schedules. These are usually used in mass production scenarios. Other Algorithms Fewest operations remaining (FOR) It is a variant of SPT, wherein the jobs are scheduled based on the number of successive operations remaining before one can assume the job to be complete. The fewer the operations in that job that remain, the earlier the job is scheduled for production Minimum Planned Start Date A master schedule that has been already prepared is looked up to find a job that is scheduled to start first. The one that has the earliest start date is taken up first for processing. It is also called Earliest Start Date (ESD). Least setup (LSU) This rule aims at maximizing machine utilization. The job with the least setup time/changeover time is scheduled first. Performance of Common Scheduling algorithms A study conducted by Hughes Aircraft (LeGrande) indicates the following: Minimum Processing Time has the best efficiency and flow rate measures Minimum Slack Time per Operation meets the due dates best. First Come First Serve and Minimum Planned Start Date algorithms usually perform worse than Random selection in most of the cases.
Team (in alphabetical order) Amit Sarda (PGP-11-101) Nishank Sethi (PGP-11-131) Pooja Shrivastava (PGP-11-135) Priya Zacharia (PGP-11-142) Shouvik S Mazumdar (PGP-11-159) Swati Karle (PGP-11-168)