China
Africa
Explore chapters and articles related to this topic
1
Published in Don Potter, Manton Matthews, Moonis Ali, Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, 2020
This inverse traverse of the path on the tree must be done as fast as possible. It is assumed that the transition over the traffic states of the qualitative data is continuous, that is, from a given state only two possible transitions are possible: 1) to a state representing the immediate upper degree of traffic density, or 2) to a state representing the immediately lower degree of traffic density. The discontinuities between qualitative traffic states are not allowed (by example, it is not allowed that the next traffic state to a qualitative state free could be the qualitative state congestive). With this assumption, the set of all the possible paths on the tree can be represented as a regular language. The lineal left regular grammar that generates this language is the one defined by the following production set: Start Symbol: S; P = {(S, Ee), (S, Ff), (S, Mm), (S, Cc), (S, Qq), (E, Ee), (E, Ff), (E, λ), (F, Ff), (F, Mm), (F, Ee), (F, λ), (M, Mm), (M, Cc), (M, Ff), (M, λ),(C, Cc), (C, Qq), (C, Mm), (C, λ), (Q, Qq), (Q, Cc), (Q, λ)}
The Use of Filtration and Ultrafiltration for Size Fractionation of Aquatic Particles, Colloids, and Macromolecules
Published in Jacques Buffle, Herman P. van Leeuwen, Environmental Particles, 2019
J. Buffle, D. Perret, M. Newman
There is little information on the reproducibility of membrane pore size distribution and porosity from one production set to another. This is partly because a detailed check of these properties is difficult and time consuming for most filters. The easiest global test is to measure the pure water flow rate Jw (in ml.cm−2.s−1 or m.s−1), which is related to the average pore radius, rp by:11,21,132 () JW=ϵrp2ΔP8ητl
Inventory Management
Published in N.V.S. Raju, Operations Research, 2019
Thus in addition to the usual assumption the following points are assumed in this model. Supply is continuous till qmax is reached and then it stops.The production rate or supply rate (say r) is greater than demand or consumption rate (d) i.e., r > d.Production begins immediately after production set-up.During production also consumption will be there and when (Qmax reaches, production stops while consumption continues till Qmin is reached.
Shop floor to cloud connect for live monitoring the production data of CNC machines
Published in International Journal of Computer Integrated Manufacturing, 2020
Prathima B A, Sudha P N, Suresh P M
The developed production data monitoring system was implemented in an Indian SME (Small and Medium Enterprise) which is engaged in mass production of plug shell components. Plug Shells are the steel housing of spark plugs inside which the electrode is housed and is bound by a ceramic insulator. As spark plugs are used in automotive OEMs and also in the spare market, the requirement is large in number. The Indian SME which is engaged in manufacturing of these parts produces 10,000 components per day using four CNC Machines. The CNC Machines are equipped with Siemens 802D CNC System. The Cycle time per component is 29 seconds. The operator is engaged most of the time in component inspection and filling up the inspection reports. It was observed that the operator missed capturing the correct data about production, idle time and the rejection. It was an invitation to apply the live production data monitoring system in the subject’s production set-up. The above live data monitoring system was applied in the machining set-up, which systematically solved the issues faced by the conventional data collection method explained in Section 3.
Spatial specification and reasoning using grammars: from theory to application
Published in Spatial Cognition & Computation, 2018
Yufeng Liu, Kang Zhang, Jun Kong, Yang Zou, Xiaoqin Zeng
A SGG is a 4-tuple: gg=(A, P, T, N), where A is an initial graph. P is a production set. T and N are the terminal and non-terminal node sets respectively. A node has a two-level structure: the node itself and the small rectangles called vertices embedded in the node, as shown in Figure 3. All vertices in a node should be uniquely labeled. In order to identify any graph elements that should be preserved during the transformation process, each isomorphic vertex in a production graph is marked by prefixing its label with an integer unique in the node. Figure 4 shows a SGG production that has two pairs of vertexes marked “1” and “2” respectively. The purpose of marking a vertex is to establish a connection between the surrounding of a redex and its replacing graph to preserve the context. Based on the marking mechanism, an embedding rule: If a vertex in the right graph of the production is unmarked and has an isomorphic vertex “v” in the redex of the host graph, then all edges connected to “v” should be completely inside the redex. This rule elegantly avoids ambiguity and dangling edges.
Scheduling a manufacturing process with restrictions on resource availability
Published in International Journal of Production Research, 2018
In this section, we present a heuristic procedure that finds a feasible solution to models (P1) and (P2). Let LDA’s Lagrangian solution be represented by (X, U) and LDB’s Lagrangian solution by (X, U, Z). In each Lagrangian solution, we focus our attention on perturbing U for a number of reasons: (a) U represents the production set-ups over T periods. It provides the assignment of products to production lines and the production sequence of those products which are key decisions in production scheduling. It satisfies Constraints (3), (5), (6), and (8) representing more than half of the technical constraints in (P1) and (P2); (b) the resource constraint violations in the Lagrangian solution can be eliminated easily by shutting down production lines, i.e. setting some Us to zero; and (c) for production lines with set-ups, which are associated with U’s that are set to one in the Lagrangian solution, producing pmax on those lines might eliminate the unsatisfied demands. The Lagragian heuristic consists of 3 phases. They are as follows: