Back
ExercisesBy topic

Prioritization rules Testo soluzione

Topic-based study materials for Industrial Technologies in the Management Engineering degree programme at Politecnico di Milano. The document covers: 01. Line Balancing 1 P RIORITIZATION R ULES In the following exercise we will calculate the efficiency of each line, since the best solution should be the one with the highest efficiency - Balance the line with the different models ( MaxDur , M a xNFol , RPW ) In doing such a

Industrial TechnologiesBy topic

Document information

What's included in this study material

Topic-based study materials for Industrial Technologies in the Management Engineering degree programme at Politecnico di Milano. The document covers: 01. Line Balancing 1 P RIORITIZATION R ULES In the following exercise we will calculate the efficiency of each line, since the best solution should be the one with the highest efficiency - Balance the line with the different models ( MaxDur , M a xNFol , RPW ) In doing such a

Import quality: text was extracted directly from the original document.

Extracted content from the document

Representative passages recognised in different parts of the material. The full extracted text remains available to search, while this compact preview makes the page easier to read.

Page 1

01. Line Balancing 1 P RIORITIZATION R ULES In the following exercise we will calculate the efficiency of each line, since the best solution should be the one with the highest efficiency - Balance the line with the different models ( MaxDur , M a xNFol , RPW ) In doing such a work, start always from scratch. You should apply TOP and SOP approach in the 3 models - Calculate the Balance Efficiency (Eb) of your designed solution (use formula below) ( ) = ∑ ( ) ( ) 1. MaxDur : The processing time of the i - th operation is considered as priority index. - Operations (those available) are ranked with descending order (thus setting as first the largest processing time ti). - Operations with larger processing time ti are thus assigned as soon as possible (when spare/idle time is more available …), thus having t he ones with smaller processing time available for filling - up. 2. MaxNFol : The largest number of operations immediately following the i - th operation is considered as priority index (NFollowing). - Operations with larger number of following operations are thus assigned as soon as possible, thus increasing the number of alternatives. - Subcriterion: MaxDur 3. Ranked Positional Weighting A task is prioritized by the cumulative assembly time associated with the task itself and its successors ( ) = + ∑ w in S(i) where: S(i) successor tasks to task i Different approaches (using the same rule) can be adopted: - “Task - oriented” - TOP , when the remaining idle time is not sufficient to assign the i - th operation, a new workstation is opened - “Station - oriented” - SOP , when the remaining idle time is not sufficient to assign the i - th operation, before opening a new station, other available operations are taken into consideration to fill - up Operation Work content…

Preview

First page of the document.

First page: Prioritization rules Testo soluzione