Dynamic machine routing, Mechanical Engineering

Dynamic Machine Routing

 Machine routing identifies the machines that are needed for each of the operation of a given job. Within the JSP or Job Shop Scheduling Problem model, these precedence relations are submitted as technological constraints and they are usually in use as fixed and predetermined. Conversely, owing to the programmable and flexible nature of the classical equipment utilized in computer-controlled systems, machine routing frequently taken a dynamic decision process.

Identify a feature on a part which may be machined on either of two various machines. During forming a routing decision, one may prefer to route the element based upon the stake of the machines at that time. For illustration, specified two machines, r and s, suppose a part can be processed quicker on r than on s; conversely at a specified time, this may be desirable to process this on s since r is busy processing other jobs.

Optional machine routings can be presented by using OR-graphs. Within the OR-graphs G (N, A), each node in N is related along with a processing operation, and the arcs in A are related along with the technological precedence relations among them. A significant characteristic of OR-graphs is such only one outgoing arc should be contained in some solution.  Thus,  at  each  node  in  the  graph,  the  related  decision  problem  is estimating that alternative (outgoing arc) to choose. Notice that, in the traditional JSP, G (N, A) will contain an easy path of operations and no decisions concerning optional plans require considerations. This is well established that by using optional plans specified machine breakdowns or other system state information offers immense results. Via incorporating results optional process plans throughout the schedule generation, one must expect improved results than attempting to resolve process scheduling and planning independently. Obviously, the computational burden will rise. This is due to the additional disjunctions related the technological constraints, additionally to the disjunctive constraints related along with machine capacity, deadlock avoidance and part contact.

This is worthwhile noting that it is rather possible to contain optional process plans (that is processing steps) to be executed on the similar machine. This additional difficulty may also be modeled via extending the OR-graphs presentation mentioned above.

 

Posted Date: 3/5/2013 7:12:37 AM | Location : United States







Related Discussions:- Dynamic machine routing, Assignment Help, Ask Question on Dynamic machine routing, Get Answer, Expert's Help, Dynamic machine routing Discussions

Write discussion on Dynamic machine routing
Your posts are moderated
Related Questions
Backup Purge Backup purge gas can also be used to protect the under side of the weld and its adjacent base metal surfaces from oxidation on the time of welding . Uniformity

how do I Create appropriate costing systems and techniques for specific engineering business functions.


Explain the statement- subsidence of  the ground Another type of problem is the subsidence of  the ground due to breakdown of weak rocks like  limestone, soluble rocks (gypsum

Induction Heating: Alternating current throughout induction coil adjacent the part to be treated induces eddy current via the part that is so heated. The benefit of such heati

Employability skills required for effective employment

Capacitor Discharge Welding This is used for welding of studs, welding of thermocouples, etc. on the base metal. A low voltage, high amperage electrical discharge from a capac

Thrust diagrams for the beam: Illustrate the shear force, bending moment & thrust diagrams for the beam illustrated in Figure Figure Solution Vertical compo

how will u designate a v belt

There are various refrigeration systems employing various methods. State any seven (7) refrigeration systems, mention the method(s) employed to attain low temperatures, and state a