Sequencing

By -

Learning Outcome:

After undergoing this module, the student must be able to exhibit the knowledge about

1. . Sequencing

2. Rationale of sequencing

3. Method of simulation using bellman Johnson rule

4. Case of 2 Machines X n jobs

5. 10 . Case of 3 machines X n jobs

6. Case of 2 jobs X M machines

4.7. Rationale of Sequencing

• It helps in reducing

1. Total elapsed operational time

2. Idle time of Jobs getting processed

3. Idle time of Machines/ operator

4. Optimization in resource cost

4.8. Scope of Sequencing It is applicable in

Finding optimal sequence of processing multiple jobs to two or more operators/ machines

4.9. Meaning of Sequencing

• Sequencing is a method of assigning different jobs to different machines / operators in order to optimize the processing time and hence the cost.

4.10. Bellman Johnson’s rule of sequencing applicable to

a) n jobs X 2 Machines

b) n jobs X 3 machines

c) 2Jobs X m machines

4.11 Assumptions of Sequencing

• All the jobs needs to be processed on all machines

• The jobs follows the order of processing on all machines

• One job can be assigned to one operator or machine at one time only

• First time Once the job is assigned to one machine the other machine will be Idle till it is processed.

• The Job and or Machine/Operator will be idle when either is busy.

4.12 Bellman Johnson’s Rule

a) n jobs X 2 M/c

1. Select the min of set of processing time of all jobs on all machines. If tie or more than one job has got same min then select arbitrarily both jobs

2. Assign that min processing time job/s to corresponding operator/ Machine .

3. Discord the other machine or operator so that no more assignment is done for that .

4. Repeat step 1 till all the jobs are assigned

image

image

image

image

Solution

clip_image034

 

image

Comments

Post a Comment

Popular posts from this blog

DUALITY THEORY:THE ESSENCE OF DUALITY THEORY

By -
Image
THE ESSENCE OF DUALITY THEORY Given our standard form for the primal problem at the left (perhaps after conversion from another form), its dual problem has the form shown to the right. Thus, with the primal problem in maximizatio n form, the dual problem is in minimization form instead. Furthermore, the dual problem uses exactly the same pa r amete r s as the primal problem, but in different locations, as summarized below. 1. The coefficients in the objective function of the primal problem are the right-hand sides of the functional constraints in the dual problem. 2. The right-hand sides of the functional constraints in the primal problem are the coef- ficients in the objective function of the dual problem. 3. The coefficients of a variable in the functional constraints of the primal problem are the coefficients in a functional constraint of the dual problem. To highlight the comparison, now look at these same two problems in matrix notation (as introduced at the beginn
Read more

NETWORK OPTIMIZATION MODELS:THE MINIMUM SPANNING TREE PROBLEM

By -
Image
THE MINIMUM SPANNING TREE PROBLEM The minimum spanning tree problem bears some similarities to the main version of the shortest-path problem presented in the preceding section. In both cases, an undi r ecte d and connected network is being considered, where the given information includes some mea- sure of the positive length (distance, cost, time, etc.) associated with each link. Both problems also involve choosing a set of links that have the shortest total length among all sets of links that satisfy a certain property. For the shortest-path problem, this property is that the chosen links must provide a path between the origin and the destination. For the minimum spanning tree problem, the required property is that the chosen links must provide a path between ea c h pair of nodes. The minimum spanning tree problem can be summarized as follows: 1. You are given the nodes of a network but not the links. Instead, you are given the po- tential links and the positive length for each
Read more

NETWORK OPTIMIZATION MODELS:THE SHORTEST-PATH PROBLEM

By -
Image
THE SHORTEST-PATH PROBLEM Although several other versions of the shortest-path problem (including some for directed networks) are mentioned at the end of the section, we shall focus on the following simple version. Consider an undi r ecte d and connected network with two special nodes called the origin and the destination. Associated with each of the links (undirected arcs) is a non- negative distance. The objective is to find the shortest path (the path with the minimum total distance) from the origin to the destination. A relatively straightforward algorithm is available for this problem. The essence of this procedure is that it fans out from the origin, successively identifying the shortest path to each of the nodes of the network in the ascending order of their (shortest) distances from the origin, thereby solving the problem when the destination node is reached. We shall first outline the method and then illustrate it by solving the shortest-path problem encountered by the See
Read more