A flow shop consists of 3-Machines on which 4-Jobs have to be scheduled in a fixed sequence. The process times of the four jobs are given in the table below. In this table P₁j, P2j and p3, indicate the process time of the jth job on Machine-1, Machine-2 P3j and Machine-3 respectively. Work out a near-optimum schedule of processing the jobs for heuristically minimizing the Makespan using Palmer's Method.

Precision Machining Technology (MindTap Course List)
2nd Edition
ISBN:9781285444543
Author:Peter J. Hoffman, Eric S. Hopewell, Brian Janes
Publisher:Peter J. Hoffman, Eric S. Hopewell, Brian Janes
Chapter8: Computer Numerical Control
Section8.4: Cnc Turning: Setup And Operation
Problem 4RQ: What is the process called where a program is sent to a machine one block at a time as the machine...
icon
Related questions
Question
A flow shop consists of 3-Machines on which 4-Jobs have to be scheduled in a fixed
sequence. The process times of the four jobs are given in the table below. In this table
Pij, P2j and p3j indicate the process time of the jth job on Machine-1, Machine-2
and Machine-3 respectively. Work out a near-optimum schedule of processing the
jobs for heuristically minimizing the Makespan using Palmer's Method.
Job (j)
J1
J2
J3
J4
4
8
4
2
2i
P3j
4
Calculate the following:
(i)
The Minimum and the Maximum Processing Times on the 3-machine and
hence conclude whether the machines satisfy the Johnson's criteria for 3-
machines.
(ii)
(ii)
Calculate the Directed Graph and Gant Chart;
Hence calculate the value of Makespan, Cmax.
(iv)
Calculate the slope-index and hence decide the heuristic schedule;
SO53
5M56
Transcribed Image Text:A flow shop consists of 3-Machines on which 4-Jobs have to be scheduled in a fixed sequence. The process times of the four jobs are given in the table below. In this table Pij, P2j and p3j indicate the process time of the jth job on Machine-1, Machine-2 and Machine-3 respectively. Work out a near-optimum schedule of processing the jobs for heuristically minimizing the Makespan using Palmer's Method. Job (j) J1 J2 J3 J4 4 8 4 2 2i P3j 4 Calculate the following: (i) The Minimum and the Maximum Processing Times on the 3-machine and hence conclude whether the machines satisfy the Johnson's criteria for 3- machines. (ii) (ii) Calculate the Directed Graph and Gant Chart; Hence calculate the value of Makespan, Cmax. (iv) Calculate the slope-index and hence decide the heuristic schedule; SO53 5M56
Expert Solution
steps

Step by step

Solved in 4 steps with 15 images

Blurred answer
Knowledge Booster
Types of Loading
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, mechanical-engineering and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Precision Machining Technology (MindTap Course Li…
Precision Machining Technology (MindTap Course Li…
Mechanical Engineering
ISBN:
9781285444543
Author:
Peter J. Hoffman, Eric S. Hopewell, Brian Janes
Publisher:
Cengage Learning
Refrigeration and Air Conditioning Technology (Mi…
Refrigeration and Air Conditioning Technology (Mi…
Mechanical Engineering
ISBN:
9781305578296
Author:
John Tomczyk, Eugene Silberstein, Bill Whitman, Bill Johnson
Publisher:
Cengage Learning