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
Formula for maximum power transmitted by belt: Derive formula for maximum power transmitted by belt when centrifugal tension is considered. Sol: Let T 1  = Tension on

Applications of spot welding As spot welding can be employed for Al, Cu, Ni and Mg alloys. It is not advisable to spot weld steels with carbon content greater than 0.25 % unles

Q. Define Current for electrical resistance welding? - With other parameters kept constant, the temperature in resistance welding is regulated by controlling the magnitude a

a) By Gauss elimination method, solve x+2y+z =3 ; 2x+3y+3z =10 ; 3x-y+2z =13 b) Write a ‘C' program to find the solution of the above system of equations by Gauss Jordan meth

what is a deficient frame?

Cemented Carbide These are minute pieces along with cutting edges and mechanically jointed or brazed to tool shank. This Carbide tool tips are generated by process of powder m

Illustrate the GKS system The user communicates with the graphic system via his program. The GKS system is embedded in the user program by an application-oriented layer and a l


Q. Show Mass energy Relation? Until the time of Einstein, mass and energy were considered as two different physical quantities. But in 1905, with the help of postulates of the

Supply Chain Management: In this unit, you have learned that the supply chain is the network of autonomous and semi-autonomous business entities, which are include through ups