The classical job shop scheduling problem (jsp), Mechanical Engineering

The Classical Job Shop Scheduling Problem (Jsp)

A  job  shop  scheduling  problem  occupies  the  determination  of  beginning  time  for  all operations in a finite and specified set, N. Related along with each operation i ε N there is a processing time pi. The operations in set N are portioned in n equally exclusive and exhaustive subsets Jk, here Jk is termed as job k. The operations in set N are portioned also into m equally exhaustive and exclusive subsets Mr, where Mr is the set of operations to be processed upon machine r. Also specified are the precedence associations, and the operations in a job or technological constraints. A pair (i, j), i, j ∈ Jk, imply that operation i precedes operation j in job k. Assume that Ak = {(i, j) | i, j ∈ Jk and I must precede j} indicate the set of pairs that illustrate the technological constraints related with job k. Related with every operation i ∈ N there is a processing time pi. The traditional job shop scheduling problem is to calculating the processing order of the operations in Mr, for r = 1, 2, . . . , m, such as several objective function is optimized.

This problem contains finding the vector of operation begin times, t = (t1, t2, . . . , t¦N¦), which minimizes a specified objective function Z (t). The difficulty can be formulated mathematically as given below:

(JSP): Minimize Z (t) Subjected to

 ti - 1 tj ≥ pj,                                         (i, j) ∈ Ak, k = 1, 2, . . . , n                 . . . (1)

ti  - tj ≥ pj V tj - ti ≥ pi,                          i, j, ∈ Mr, r = 1, 2, . . . , m                 . . . (2)

ti ≥ 0,                                                               i ∈ N.                                   . . . (3)

Eq. (1) makes sure that the technological constraints are satisfied. The disjunctive relation in Eq. (2) makes sure that the ability constraints on the machines are not violated that is a machine can process individual operation at a time. JSP is well identifying that it belongs to a class of the most complicated combinatorial optimization problems and it has been extensively studied.

Usual assumptions made in job shop scheduling comprise the following figure:

A1

Each job needs only one machine at a time, that is Mr ∩ Ms = φ, r ≠ s.

A2

One job processes by one machine at a time, that is | Jk ∩ Mr   | = 1, k = 1, . . . , n and r = 1, . . . , m. also this shows that a job visits each machine exactly once, that is two operations in similar job cannot use similar machine.

A 3

The  order  in  that  a  job  visits  various  machines  is  predetermined  via technological constraints, that is the set A = A1 ∪ A2 ∪ . . . ∪ An, is specified and fixed. Ak can be seemed like the machine routing or process plan for job k.

A4

No explicit consideration is specified to auxiliary resources as like: material handling, buffer space and tooling.

                                               414_The Classical Job Shop Scheduling Problem (Jsp).png

                                                 Figure: Typical Assumption Made in Job Shop Scheduling

These assumptions are suitable for manufacturing environments that is, which human intervention is important and the equipment utilized is hard automation or manual. This is also suitable in environments characterized via batch production, in that every part type has a fixed and determined process plan. A specified workstation or machine is pre- assigned to execute each step in the process plan.

Posted Date: 3/5/2013 7:02:28 AM | Location : United States







Related Discussions:- The classical job shop scheduling problem (jsp), Assignment Help, Ask Question on The classical job shop scheduling problem (jsp), Get Answer, Expert's Help, The classical job shop scheduling problem (jsp) Discussions

Write discussion on The classical job shop scheduling problem (jsp)
Your posts are moderated
Related Questions
Stroke and Clearance Volume: Stroke The distance traveled by piston from the topmost positions of it (also called Top dead centre TDC ), to its bottom most position (or

In designing piping systems, it is sometimes desirable to estimate the appropriate pipe length for a given diameter, pump power and flow rate. In such cases, if minor pipe losses a

A multiple disc clutch, steel on bronze, is to transmit 4.5 kW at 750 r.p.m. The inner radius of contact is 40mm and outer radius of the contact is 70 mm. The clutch operates in oi

A copper tube 1.2 m long, has 80mm internal diameter and 2 mm wall thickness. It has closed ends, and is filled with water under pressure. What will be the alteration of pressure i

three vertical, parallel straight rods, each 2.6m in length have their upper ends firmly secured and their lower supporting a rigid horizontal bar with a weight of 8KN, which cause

Thermodynamic process - Thermodynamics: Thermodynamic system undergoes changes because of the energy and mass interactions. Thermodynamic state of system changes because of th

Calculate tensions in chain and chord - Mechanics: A lamp of mass 1Kg is hung from the ceiling by a chain and is pulled aside by horizontal chord until the chain makes an ang

ULTRASONIC WELDING This is a solid state welding process for joining similar or dissimilar metals by application of high frequency vibratory energy to work pieces held togethe


SHELLS: In the topic (SHELLS) , we have seen the assumptions made in the analysis of thin shells. For a spherical shell, which is symmetrical in all of the directions, the ho