This presentation is about Value Engineering and contains:
1.History of VE
2.Value Concept
3.What is Value Engineering?
4.Implementation of VE in our project
5.Principle and Purpose of VE
6.Case Study
7.Conclusion
Material Resource Planning (MRP)
Objectives of MRP
Fundamental concepts of MRP
Functions of MRP
Inputs to MRP
Master production schedule(MPS)
Bill of Materials (BOM)
Inventory Status File
MRP outputs
Learning Curve
Negotiating
ALDEP++: An improvement on the ALDEP heuristic via department batching.Palaque Thakur
ALDEP++ is an algorithm developed in MATLAB. It is a version 2.0 of ALDEP, adding departments in batches and use flow*distance as measure. Hence, overcoming shortsightedness of ALDEP and producing more optimized solutions.
This presentation is about Value Engineering and contains:
1.History of VE
2.Value Concept
3.What is Value Engineering?
4.Implementation of VE in our project
5.Principle and Purpose of VE
6.Case Study
7.Conclusion
Material Resource Planning (MRP)
Objectives of MRP
Fundamental concepts of MRP
Functions of MRP
Inputs to MRP
Master production schedule(MPS)
Bill of Materials (BOM)
Inventory Status File
MRP outputs
Learning Curve
Negotiating
ALDEP++: An improvement on the ALDEP heuristic via department batching.Palaque Thakur
ALDEP++ is an algorithm developed in MATLAB. It is a version 2.0 of ALDEP, adding departments in batches and use flow*distance as measure. Hence, overcoming shortsightedness of ALDEP and producing more optimized solutions.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Sequences classification based on group technology for flexible manufacturing...eSAT Journals
Abstract Flexible cell formation is based on Group Technology. Group Technology rests on the exploitation of resemblances between products or processes, which makes the identification of products’ families and machines’ cells easier. We propose a new approach based on the language theory for product family grouping according to their manufacturing sequences. This approach uses linear sequences of the manufacturing products which are assimilated to the words of a language. We have chosen the Levenhstein distance for sequence classification. We are going to compare our method to Dice-Czekanowski and Jaccard’s methods and apply the vectorial correlation coefficient as a comparison tool between two hierarchical classifications. Keywords: manufacturing sequences, language theory, hierarchical classification, Group Technology.
An analysis between exact and approximate algorithms for the k-center proble...IJECEIAES
This research focuses on the k-center problem and its applications. Different methods for solving this problem are analyzed. The implementations of an exact algorithm and of an approximate algorithm are presented. The source code and the computation complexity of these algorithms are presented and analyzed. The multitasking mode of the operating system is taken into account considering the execution time of the algorithms. The results show that the approximate algorithm finds solutions that are not worse than two times optimal. In some case these solutions are very close to the optimal solutions, but this is true only for graphs with a smaller number of nodes. As the number of nodes in the graph increases (respectively the number of edges increases), the approximate solutions deviate from the optimal ones, but remain acceptable. These results give reason to conclude that for graphs with a small number of nodes the approximate algorithm finds comparable solutions with those founds by the exact algorithm.
M210 Songyue.pages
__MACOSX/._M210 Songyue.pages
M210-S16-class-5.pdf
M 210 More drawing in LATEX February 23, 2016
Arcs
An arc of radius r from point (p,q) with initial angle ϕ (phi) and final angle ψ (psi) is drawn in
TikZ by the code
LATEX\draw (p,q) arc (phi:psi:r);
Note that TikZ does not require the center (a,b), which is often easier to determine that the arc’s
initial point. Polar coordinates (relative to the arc’s center) can be used to express the initial point
in terms of the arc’s center.
(a,b)
(p,q)
ϕ
ψ
r
p = a + r cosϕ
q = b + r sinϕ
In tikzpicture environment enter
\draw ({a+r*cos(phi)},{b+r*sin(phi)}) arc (phi:psi:r);
for the specific values of a, b, r, ϕ (phi) and ψ (psi).
LATEX
According to the TikZ’s manual, by default arcs are drawn in positive (counter-clockwise) direction,
assuming initial angle ϕ to be smaller than ψ. However, I have been able to draw arcs in negative
(clockwise) direction by choosing an initial angle larger than final angle.
Precise Label Positioning
The relative positions above, below, left, right, above left, above right, below left, and
below right, provide positioning relative to the node (indicated by the dot) as illustrated in the
following figures.
below
above
left right
above left
below left
above right
below right
While it is possible to adjust the separation between label and node, it is not that easy to adjust
the angle (the above provide label placement only for angles in multiples of 45◦). The following will
work to place the label (that is its center) at the the indicated position: precise distance s at relative
angle θ from the position of the node.
node
lab
el
s
node coordinates (nx,ny)
label coordinates (lx, ly)
θ
To place label at the above mentioned position use the code (where θ is theta degrees):
M 210 — February 23, 2016 page 44
LATEX\draw ({nx + s*cos(theta)}, {ny + s*sin(theta)}) node {label};
To rotate the label as in the above illustration, use code:
LATEX\draw ({nx + s*cos(theta)}, {ny + s*sin(theta)}) node {\rotatebox{theta}{label}};
Special Triangles
In trigonometry the triangles with degrees 45-45-90 and 30-60-90 provide exact values for the trigono-
metric functions. It is quite easy to obtain the exact values of angles of 15 and 75 degrees from those
of 30 degrees by half- and double-angle formulas and other trigonometric identities, however, these
values can also be obtained from the following figure containing an equilateral triangle in a square
with sides equal to 2.
1
The Regular Pentagon. Use trigonometric functions to draw a regular pentagon with its lower
side along the line segment from (−1,0) to (1,0). Start by drawing this line segment.
LATEX\begin{center}
\begin{tikzpicture}[scale=2]
\draw[line width=1.2pt] (-1,0) -- (1,0);
\end{tikzpicture}
\end{center}
Extend the line segment on both sides by adding the following code.
LATEX\draw[line width=1.2pt] (1,0) -- ({1+2*cos(72)},{2*sin(72)});
\draw[line width=1.2pt] ...
Parallel Evaluation of Multi-Semi-JoinsJonny Daenen
Presentation given on VLDB 2016: 42nd International Conference on Very Large Data Bases.
Paper: http://dx.doi.org/10.14778/2977797.2977800
ArXiv: https://arxiv.org/abs/1605.05219
Poster: https://zenodo.org/record/61653 (doi 10.5281/zenodo.61653)
Gumbo Software: https://github.com/JonnyDaenen/Gumbo
Abstract
While services such as Amazon AWS make computing power abundantly available, adding more computing nodes can incur high costs in, for instance, pay-as-you-go plans while not always significantly improving the net running time (aka wall-clock time) of queries. In this work, we provide algorithms for parallel evaluation of SGF queries in MapReduce that optimize total time, while retaining low net time. Not only can SGF queries specify all semi-join reducers, but also more expressive queries involving disjunction and negation. Since SGF queries can be seen as Boolean combinations of (potentially nested) semi-joins, we introduce a novel multi-semi-join (MSJ) MapReduce operator that enables the evaluation of a set of semi-joins in one job. We use this operator to obtain parallel query plans for SGF queries that outvalue sequential plans w.r.t. net time and provide additional optimizations aimed at minimizing total time without severely affecting net time. Even though the latter optimizations are NP-hard, we present effective greedy algorithms. Our experiments, conducted using our own implementation Gumbo on top of Hadoop, confirm the usefulness of parallel query plans, and the effectiveness and scalability of our optimizations, all with a significant improvement over Pig and Hive.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Saudi Arabia stands as a titan in the global energy landscape, renowned for its abundant oil and gas resources. It's the largest exporter of petroleum and holds some of the world's most significant reserves. Let's delve into the top 10 oil and gas projects shaping Saudi Arabia's energy future in 2024.
Explore the innovative world of trenchless pipe repair with our comprehensive guide, "The Benefits and Techniques of Trenchless Pipe Repair." This document delves into the modern methods of repairing underground pipes without the need for extensive excavation, highlighting the numerous advantages and the latest techniques used in the industry.
Learn about the cost savings, reduced environmental impact, and minimal disruption associated with trenchless technology. Discover detailed explanations of popular techniques such as pipe bursting, cured-in-place pipe (CIPP) lining, and directional drilling. Understand how these methods can be applied to various types of infrastructure, from residential plumbing to large-scale municipal systems.
Ideal for homeowners, contractors, engineers, and anyone interested in modern plumbing solutions, this guide provides valuable insights into why trenchless pipe repair is becoming the preferred choice for pipe rehabilitation. Stay informed about the latest advancements and best practices in the field.
Cosmetic shop management system project report.pdfKamal Acharya
Buying new cosmetic products is difficult. It can even be scary for those who have sensitive skin and are prone to skin trouble. The information needed to alleviate this problem is on the back of each product, but it's thought to interpret those ingredient lists unless you have a background in chemistry.
Instead of buying and hoping for the best, we can use data science to help us predict which products may be good fits for us. It includes various function programs to do the above mentioned tasks.
Data file handling has been effectively used in the program.
The automated cosmetic shop management system should deal with the automation of general workflow and administration process of the shop. The main processes of the system focus on customer's request where the system is able to search the most appropriate products and deliver it to the customers. It should help the employees to quickly identify the list of cosmetic product that have reached the minimum quantity and also keep a track of expired date for each cosmetic product. It should help the employees to find the rack number in which the product is placed.It is also Faster and more efficient way.
1. MEE1018 Facilities and process planning
Layout Planning (CRAFT algorithm)
CRAFT procedure
S1: Input the details
S2: Compute centroids of departments in the present layout
S3: Form distance matrix using the centroids
S4: Compute the total handling cost
S5: Find all the possible pairwise interchanges of departments based on common border or
equal area criterion; For each possibility, interchange the corresponding centroids and
compute approximate costs
S6: Find the pair of departments corresponding to the minimum handling cost from among all
the possible pairs of interchanges
S7: Is the cost in the previous step less than the total cost of the present layout? If yes, go to
S8. If not, go to S11
S8: Interchange the selected pair of departments; Call this as NEW LAYOUT
Compute centroids, distance matrix and total cost
S9: Is the cost of new layout less than the cost of the present layout?
If yes, go to S10; If not, go to S11
S10: The new layout is here after considered as the PRESENT LAYOUT
Its data on centroids, layout matrix, and the total cost is retained
Go to S5
S11: Print the present layout as the FINAL LAYOUT
S12: Stop
Problem:
Consider the following initial layout with unit cost matrix.
Initial Layout
4 6 8
6 A B C
Flow Matrix
To
From
A B C
A
B
C
-
2
6
1
-
2
8
1
-
Use the CRAFT pairwise interchange technique to obtain the desirable layout.
2. Solution:
S1: Total number of departments: 3 Total number of interchangeable departments: 3
Initial Layout:
4 6 8
6 A B C
Cost matrix [cij]
To
From
A B C
A
B
C
-
1
1
1
-
1
1
1
-
Flow matrix [fij]
To
From
A B C
A
B
C
-
2
6
1
-
2
8
1
-
Area of departments
Department A B C
Area (Sq.
Units)
24 36 48
S2: Centroids of all departments are calculated. Left side and bottom side of the layout
are assumed as Y and X axes respectively
(XA, YA) = (2, 3); (XB, YB) = (7, 3); (XC, YC) = (14, 3)
S3: The distance between any two departments is given by rectilinear distance between
the centroids of the two departments
dij = |(Xi – Xj) + (Yi – Yj)| where (Xi, Yi) and (Xj, Yj) are the centroids
Distance matrix [dij]
To
From
A B C
A
B
C
-
5
12
5
-
7
12
7
-
S4: Total cost of handling for the present layout is calculated
Total cost = ∑ ∑ 𝑓𝑖𝑗 × 𝑑𝑖𝑗 × 𝑐𝑖𝑗
3
𝑗=1
3
𝑖=1
3. Total cost matrix [TCij]
To
From
A B C
A
B
C
-
10
72
5
-
14
96
7
-
Total cost = 204
S5: Consider various departmental interchanges for improvement
Departmental interchanges that are possible are given below
Departments having common border and Departments having common area
Pairwise interchanges are considered; For 3 departments, 3 pairwise interchanges are
Possible
Pair of departments Remark
A and B
A and C
B and C
Interchange based on common border
Not possible
Interchange based on common border
For the purpose of cost calculation, an interchange between two departments would
mean that their present centroids are interchanged
For each interchange, the associated distance and total cost matrices are calculated
Interchange between A and B
(XB, YB) = (2, 3); (XA, YA) = (7, 3); (XC, YC) = (14, 3)
Distance matrix [dij]
To
From
A B C
A
B
C
-
5
7
5
-
12
7
12
-
Total cost matrix [TCij]
To
From
A B C
A
B
C
-
10
42
5
-
24
56
12
-
Total cost = 149
Interchange between B and C
(XA, YA) = (2, 3); (XC, YC) = (7, 3); (XB, YB) = (14, 3)
4. Distance matrix [dij]
To
From
A B C
A
B
C
-
12
5
12
-
7
5
7
-
Total cost matrix [TCij]
To
From
A B C
A
B
C
-
24
30
12
-
14
40
7
-
Total cost = 127
S6: The interchange which promises minimum handling cost is selected for actual
interchange in the layout; interchange between B and C results in minimum cost
S7: This cost is compared with the cost of the present layout; this cost of 127 is less
compared with the cost of 204 for the present layout
S8: Interchange is made between B and C. New layout is drawn
4 8 6
6 A C B
The centroids are
(XA, YA) = (2, 3); (XB, YB) = (15, 3); (XC, YC) = (8, 3)
Distance matrix [dij]
To
From
A B C
A
B
C
-
13
6
13
-
7
6
7
-
Total cost matrix [TCij]
To
From
A B C
A
B
C
-
26
36
13
-
14
48
7
-
Total cost = 144
S9: The total cost of the new layout is compared with the cost of the present layout
Since the cost is less, the new layout is treated as the present layout
The process is repeated for the next iteration