All Courses
Get the App Signup / Login
Sign in Open App
Mechanical Engineering Exam  >  Mechanical Engineering Tests  >  Industrial Engineering  >  Test: Sequencing And Scheduling - Mechanical Engineering MCQ

Test: Sequencing And Scheduling - Mechanical Engineering MCQ


Test Description

28 Questions MCQ Test Industrial Engineering - Test: Sequencing And Scheduling

Test: Sequencing And Scheduling for Mechanical Engineering 2024 is part of Industrial Engineering preparation. The Test: Sequencing And Scheduling questions and answers have been prepared according to the Mechanical Engineering exam syllabus.The Test: Sequencing And Scheduling MCQs are made for Mechanical Engineering 2024 Exam. Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests for Test: Sequencing And Scheduling below.
Solutions of Test: Sequencing And Scheduling questions in English are available as part of our Industrial Engineering for Mechanical Engineering & Test: Sequencing And Scheduling solutions in Hindi for Industrial Engineering course. Download more important topics, notes, lectures and mock test series for Mechanical Engineering Exam by signing up for free. Attempt Test: Sequencing And Scheduling | 28 questions in 30 minutes | Mock test for Mechanical Engineering preparation | Free important questions MCQ to study Industrial Engineering for Mechanical Engineering Exam | Download free PDF with solutions
Test: Sequencing And Scheduling - Question 1
Save

In sequencing for minimizing mean tardiness and average in process inventory, the rules to be used respectively are

Test: Sequencing And Scheduling - Question 2
Save

Which of the following rules minimizes maximum lateness?

1 Crore+ students have signed up on EduRev. Have you? Download the App
Test: Sequencing And Scheduling - Question 3
Save

Tardiness is the measure of

Test: Sequencing And Scheduling - Question 4
Save

Which of the following is not an assumption of scheduling and sequencing?
Test: Sequencing And Scheduling - Question 5
Save

The number of possible ways for ‘n’ jobs to sequence
Test: Sequencing And Scheduling - Question 6
Save

If critical ratio is < 1 then
Test: Sequencing And Scheduling - Question 7
Save

Which of the following minimizes the idle time of an n-jobs and 2 machine problem?
Test: Sequencing And Scheduling - Question 8
Save

Least slack is given by
Test: Sequencing And Scheduling - Question 9
Save

Critical ratio is given by
Test: Sequencing And Scheduling - Question 10
Save

Flow time is given by
Test: Sequencing And Scheduling - Question 11
Save

Apply FCFS rule and find the mean flow time
Detailed Solution for Test: Sequencing And Scheduling - Question 11

Sequence for FCFS will be 1 − 2 − 3 − 4 − 5

Test: Sequencing And Scheduling - Question 12
Save

The following jobs are to be processed on a machine as per the data listed in the table below

Using SPT rule, the total tardiness is _____________
Detailed Solution for Test: Sequencing And Scheduling - Question 12

Sequence using SPT: 2 − 3 − 1 − 4

Test: Sequencing And Scheduling - Question 13
Save

The sequence that would minimize the make span
Detailed Solution for Test: Sequencing And Scheduling - Question 13

Flow time will be minimum with SPT sequence = D − B − A − C

Total FT = 38

Minimum cost = 38 × 50 = Rs. 1900

*Answer can only contain numeric values
Test: Sequencing And Scheduling - Question 14
Save

Seven jobs arrived in a sequence as given below

Calculate average flow time (in days) for the above jobs using SPT rule.

Detailed Solution for Test: Sequencing And Scheduling - Question 14

Test: Sequencing And Scheduling - Question 15
Save

Four jobs has to be processed on a single machine. The details are given in following table

The average lateness using SPT rule is ___________
Detailed Solution for Test: Sequencing And Scheduling - Question 15

Average = −3

Test: Sequencing And Scheduling - Question 16
Save

A defense contractor has six different jobs in process with the delivery requirements shown. Today is day (60) and if the contractor uses a critical ratio method for sequencing, find the sequence.
Detailed Solution for Test: Sequencing And Scheduling - Question 16

Job sequence = A − E − C − F − D − B

Test: Sequencing And Scheduling - Question 17
Save

Four jobs have to be sequenced on a single facility with the objective of minimizing the maximum lateness.

The last job that should be taken up
Detailed Solution for Test: Sequencing And Scheduling - Question 17

EDD rule minimizes the max-lateness

Test: Sequencing And Scheduling - Question 18
Save

Consider the following data

The no. of tardy jobs using SPT rule
Detailed Solution for Test: Sequencing And Scheduling - Question 18

Sequence using SPT: 3 − 1 − 2 − 4

No. of tardy jobs = 2

Test: Sequencing And Scheduling - Question 19
Save

Consider the following data for a job-shop problem

The optimal sequence for the above problem is
Detailed Solution for Test: Sequencing And Scheduling - Question 19

Convert the given problem into a two machine problem and apply Johnson’s algorithm

Max {M2} ≤ min{M1} or min{M3}

10 ≤ 5 ✘

10 ≤ 12✓

The problem can be converted

Applying Johnson’s algorithm

Test: Sequencing And Scheduling - Question 20
Save

Using Johnson’s rule find the optimal sequence
Detailed Solution for Test: Sequencing And Scheduling - Question 20

Convert 3 machine problem into a two machine problem and apply Johnson’s rule

Max {M2} ≤ min{M1} or min{M3}

6 ≤ 6✓

6 ≤ 1✘

Test: Sequencing And Scheduling - Question 21
Save

Four jobs has to be processed on a single machine. The details are given in the following data

The minimum average tardiness is.
Detailed Solution for Test: Sequencing And Scheduling - Question 21

The average tardiness is minimized when EDD rule is used sequence using EDD rule C −A − B − D

Test: Sequencing And Scheduling - Question 22
Save

Four jobs need to be processed sequentially on two machines, first on Machine X and then on Machine Y. Each machine can process only one job at a time. The processing times in(hours) are given below

The make span of the jobs is ____________
Detailed Solution for Test: Sequencing And Scheduling - Question 22

Apply Johnson’s algorithm to find the make span

*Answer can only contain numeric values
Test: Sequencing And Scheduling - Question 23
Save

Consider the following data

What will be the earliest time that B can be delivered to the customer?

Detailed Solution for Test: Sequencing And Scheduling - Question 23

According to Johnson’s rule, the optimal sequence is

Make span = 34

Job B can be delivered at the end of 21 hours

*Answer can only contain numeric values
Test: Sequencing And Scheduling - Question 24
Save

Consider the following data

The optimal sequence using Johnson’s rule is A − D − B − F − C − E. Find the make span.

Detailed Solution for Test: Sequencing And Scheduling - Question 24

Make span = 55 hours

Test: Sequencing And Scheduling - Question 25
Save

The todays date in a production calendar of an industry is 175. Sequence the jobs listed below by critical ratio rule and also find the number of jobs that are behind the schedule.
Detailed Solution for Test: Sequencing And Scheduling - Question 25

Jobs should be arranged in the increasing order of critical ratio.

Sequence: F − C − G − E − D − B − A

Number of jobs behind schedule = no. of jobs whose critical ratio is less than 1

i.e., C & F in this case

∴ Number of jobs = 2

*Answer can only contain numeric values
Test: Sequencing And Scheduling - Question 26
Save

Consider the following 2 job and M-Machine problem

Job1 Lathe (2 hours) → Milling (1 hour)→→Drilling (4hours)

Job 2 Milling (1 hour)→ Lathe (3 hours) → Drilling (3 hours)

Find the make span.

Detailed Solution for Test: Sequencing And Scheduling - Question 26

Make span = 10 hours

*Answer can only contain numeric values
Test: Sequencing And Scheduling - Question 27
Save

Using graphical method, determine the minimum time needed to process the two jobs on four machines

Detailed Solution for Test: Sequencing And Scheduling - Question 27

Total completion time = 4+2+5+7+3 = 15

= 15 hours

Test: Sequencing And Scheduling - Question 28
Save

There are six cars waiting to be repaired at a car repair shop. Each car has first to be dented and then painted. The estimated times for each car are given below

Find the total idle time for machine.
Detailed Solution for Test: Sequencing And Scheduling - Question 28

Idle time = 8 hours

30 videos|40 docs|30 tests
Join Course
Information about Test: Sequencing And Scheduling Page
In this test you can find the Exam questions for Test: Sequencing And Scheduling solved & explained in the simplest way possible. Besides giving Questions and answers for Test: Sequencing And Scheduling, EduRev gives you an ample number of Online tests for practice

Top Courses for Mechanical Engineering

30 videos|40 docs|30 tests
Join Course
Download as PDF

Top Courses for Mechanical Engineering

Important Questions for Sequencing And Scheduling

Find all the important questions for Sequencing And Scheduling at EduRev.Get fully prepared for Sequencing And Scheduling with EduRev's comprehensive question bank and test resources. Our platform offers a diverse range of question papers covering various topics within the Sequencing And Scheduling syllabus. Whether you need to review specific subjects or assess your overall readiness, EduRev has you covered. The questions are designed to challenge you and help you gain confidence in tackling the actual exam. Maximize your chances of success by utilizing EduRev's extensive collection of Sequencing And Scheduling resources.

Sequencing And Scheduling MCQs with Answers

Prepare for the Sequencing And Scheduling within the Mechanical Engineering exam with comprehensive MCQs and answers at EduRev. Our platform offers a wide range of practice papers, question papers, and mock tests to familiarize you with the exam pattern and syllabus. Access the best books, study materials, and notes curated by toppers to enhance your preparation. Stay updated with the exam date and receive expert preparation tips and paper analysis. Visit EduRev's official website today and access a wealth of videos and coaching resources to excel in your exam.

Online Tests for Sequencing And Scheduling Industrial Engineering

Practice with a wide array of question papers that follow the exam pattern and syllabus. Our platform offers a user-friendly interface, allowing you to track your progress and identify areas for improvement. Access detailed solutions and explanations for each test to enhance your understanding of concepts. With EduRev's Online Tests, you can build confidence, boost your performance, and ace Sequencing And Scheduling with ease. Join thousands of successful students who have benefited from our trusted online resources.
© EduRev
Education Revolution
Follow Us
Signup to see your scores go up within 7 days!
Access 1000+ FREE Docs, Videos and Tests
Takes less than 10 seconds to signup