New Semester
Started
Get
50% OFF
Study Help!
--h --m --s
Claim Now
Question Answers
Textbooks
Find textbooks, questions and answers
Oops, something went wrong!
Change your search query and then try again
S
Books
FREE
Study Help
Expert Questions
Accounting
General Management
Mathematics
Finance
Organizational Behaviour
Law
Physics
Operating System
Management Leadership
Sociology
Programming
Marketing
Database
Computer Network
Economics
Textbooks Solutions
Accounting
Managerial Accounting
Management Leadership
Cost Accounting
Statistics
Business Law
Corporate Finance
Finance
Economics
Auditing
Tutors
Online Tutors
Find a Tutor
Hire a Tutor
Become a Tutor
AI Tutor
AI Study Planner
NEW
Sell Books
Search
Search
Sign In
Register
study help
business
production and operations management
Production And Operations Management 3rd Edition Panneerselvam - Solutions
Calculate the EOQs for the A items. Lop74
Based on the sample, analyse the underlying causes of the availability problem described in the text. Lop74
If so, what is your estimate of the overall inventory at the end of the base year, and how much might that have increased during the year? Lop74
Calculate the inventory weeks for each item, for each classification, and for all the items in total. Does this suggest that the operational manager’s estimate of inventory weeks is correct? Lop74
Prepare a spreadsheet-based ABC analysis of usage value. Classify as follows:A items: top 20 per cent of usage value B items: next 30 per cent of usage value C items: remaining 50 per cent of usage value Lop74
How to control the system. What procedures and routines should be installed to help make these decisions? Should different priorities be allocated to different stock items? How should stock information be stored? Lop74
When to order. At what point in time, or at what level of stock, should the replenishment order be placed (sometimes called the timing decision)? Lop74
How much to order. Every time a replenishment order is placed, how big should it be (sometimes called the volume decision)? Lop74
How can inventory be controlled? Lop74
When to place an order? The timing decision Lop74
How much to order? The volume decision Lop74
Why should there be any inventory? Lop74
What is inventory? Lop74
Compare and contrast the approaches taken by H&M, Benetton and Zara to managing their supply networks? Lop74
Why is blockchain technology so useful in supply chain management? Lop74
What are the dynamics of supply chains? Lop74
How should relationships in supply chains be managed? Lop74
How should supply chains compete? Lop74
What is supply chain management? Lop74
How can operations understand the consequences of their capacity management decisions? Lop74
How is the supply side managed? Lop74
How is the demand side managed? Lop74
How is capacity measured? Lop74
How is demand measured? Lop74
What is capacity management? Lop74
What would you suggest that subText does to tighten up its planning and control procedures? Lop74
What went wrong with the fifty-three slash F job and how could the company avoid making the same mistakes again? Lop74
What is involved in planning and control? Lop74
How does the nature of demand affect planning and control? Lop74
What are the activities of planning and control? Lop74
How do supply and demand affect planning and control? Lop74
What is the difference between planning and control? Lop74
What is planning and control? Lop74
What do you think each team leader should be doing to try and overcome their team’s problems? Lop74
How would you describe each team’s process in terms of the jobs of its staff? Lop74
What are the individual ‘services’ offered by each of the three teams? Lop74
What are the problems amongst the staff of each of the three teams? Lop74
What are the environmental conditions of the workplace? Lop74
What technology is available and how will it be used? Lop74
How do we maintain commitment? Lop74
How long will it take and how many people will be needed? Lop74
What is the best method of performing each job? Lop74
What tasks are to be allocated to each person in the operation? Lop74
How are work times allocated? Lop74
How do we go about designing jobs? Lop74
How can the operations function be organized? Lop74
Why are people issues so important in operations management? Lop74
Find the schedule using graphical method to minimize the time needed to process the following jobs on the machines shown (i.e. for each machine, find the job which should be scheduled first). Also, calculate the total time elapsed to complete both jobs.Job 1 Sequence A — B— C— D — E Time
Find the schedule using graphical method to minimize the time needed to process the following jobs on the machines shown (i.e. for each machine, find the job which should be scheduled first). Also, calculate the total time elapsed to complete both jobs.Job 1 Sequence A — B — C — D — E Time
Consider the following job shop problem. Find the scheduling using Nondelay generation heuristic with the following priority rules.First Level Priority Rule : MWKR (most work remaining)Second Level Priority Rule : SPT (shortest processing time)Third Level Priority Rule : Random order Processing
Consider the following job shop scheduling problem involving four jobs and three operations.Solve it using Active Schedule Generation Heuristic Procedure with the Most Work Remaining(MWKR) as the primary measure and SPT as the tie breaker. In case of tie on SPT, break the tie randomly.Processing
Consider the following job shop scheduling problem involving four jobs and three operations.Solve it using Non-delay Schedule Generation Heuristic Procedure with the Most Work Remaining (MWKR) as the primary measure and SPT as the tie breaker. In case of tie on SPT, break the tie
Write short notes on dispatching rules/priority rules.AppendixLO1
Explain the following:(a) Active Schedule.(b) Semiactive Schedule.(c) Nondelay Schedule.AppendixLO1
What is job shop scheduling problem? Distinguish it from flow shop scheduling problem.AppendixLO1
Between the flow shop scheduling and job shop scheduling to minimize the makespan, for the same problem size, the time taken for the job shop scheduling is that of the flow shop scheduling.(a) Equal to (b) Lesser than(c) Greater than (d) None of the above.AppendixLO1
In the job shop scheduling with 2 machines and n jobs, in the Gantt chart to minimize the makespan, a line with 45° slope is drawn from the origin to the upper right corner by the regions such that the total length of the line is maximum.(a) Avoiding (b) Passing through(c) Both (a) and (b) (d)
In the job shop scheduling with 2 machines and n jobs, in the Gantt chart to minimize the makespan, a line with 45° slope is drawn from the origin to the upper right corner by avoiding the regions such that the total length of the line is(a) Minimum (b) Medium(c) Maximum (d) None of the above
In the job shop scheduling with 2 machines and n jobs, in the Gantt chart to minimize the makespan, a line with slope is drawn from the origin to the upper right corner by avoiding the regions.(a) 15° (b) 30°(c) 45° (d) 60°AppendixLO1
In the job shop scheduling with 2 machines and n jobs, in the Gantt chart to minimize the makespan, a line is drawn from the origin to the upper corner by avoiding the regions.(a) Left (b) Right(c) Both (a) and (b) (d) None of the above AppendixLO1
The condition used in semi-active schedule generation is(a) pi = q* (b) pi > q*(c) pi < q* (d) None of the above AppendixLO1
The condition used in non-delay schedule generation is(a) = P* (b) < p*(c) > p* (d) None of the above AppendixLO1
LWKR is a dispatch rule which selects the operation associated with the job having the work remaining to be processed.(a) Largest (b) Least(c) Average (d) None of the above.AppendixLO1
MWKR is a dispatch rule which selects the operation associated with the job having the work remaining to be processed.(a) Most (b) Minimum(c) Average (d) None of the above AppendixLO1
MOPNR is a dispatch rule which selects the operation that has number of successor operations.(a) Least (b) Maximum(c) Average (d) None of the above AppendixLO1
If no machine is kept idle at a time when it could begin processing some operation, then it is called a schedule.(a) Non-delay schedules (b) Active schedules(c) Semi-active (d) None of the above AppendixLO1
The set of all schedules in which no local left-shift can be made is called the schedules.(a) Non-delay schedules (b) Active schedules(c) Semi-active (d) None of the above AppendixLO1
The set of all schedules in which no global left-shift can be made is called the schedules.(a) Non-delay schedules (b) Active schedules(c) All schedules (d) None of the above AppendixLO1
In job shop scheduling, moving various operation blocks to the left as much as possible on each machine to minimise the unwanted idle times is called(a) Local left-shift (b) Global left-shift(c) Left shift (d) None of the above AppendixLO1
The order in terms of set relationship among different schedules in job shop in increasing order of their sizes is(a) Non-delay schedules c Active schedules c Semi-active schedules c All schedules(b) Semi-active schedules c Non-delay schedules c All schedules c Active schedules(c) Semi-active
Semi-active schedules form a subset of schedules.(a) Non-delay schedules (b) Active schedules(c) All schedules (d) None of the above AppendixLO1
Semi-active schedules are generated in scheduling.(a) Single machine (b) Flow shop(c) Job shop (d) None of the above AppendixLO1
A triplet (i, j, k) is used to represent an operation in scheduling.(a) Single machine (b) Flow shop(c) Job shop (d) None of the above.AppendixLO1
In scheduling, routing data are to be given in addition to the processing times data.(a) Single machine (b) Flow shop(c) Job shop (d) None of the above AppendixLO1
In scheduling, there will be n jobs, each requiring processing on m different machines and the process sequences of the jobs are not the same.(a) Single machine (b) Flow shop(c) Job shop (d) None of the above AppendixLO1
Consider the following flow shop scheduling problem:Processing Time Job Machine 1 Machine 2 Machine 3 1 4 5 11 2 12 2 6 3 8 10 14 4 11 11 3 Check whether Johnson's rule can be applied. If not, solve the problem using Palmer's heuristic.AppendixLO1
Find the schedule for the problem in question-8 using Palmer's heuristic.AppendixLO1
Find the makespan using the CDS heuristic for the following flow shop problem:Job j tfi tj2 ti3 tj4 1 5 4 8 9 2 4 8 3 6 3 2 3 5 8 4 4 5 4 3.AppendixLO1
Find the schedule for the problem in Question 7 using CDS heuristic.AppendixLO1
Consider the following flow shop problem involving 4 jobs and 3 machines.Job j 1 2 3 4 2 10 6 9 tj2 3 1 8 11 tj3 9 4 12 1 Find the optimal makespan schedule using branch and bound technique.AppendixLO1
Consider the following flow shop problem.Job Machine 1 Machine 2 Machine 3 1 10 15 23 2 8 10 7 3 12 7 10 4 15 20 6 Find the optimal schedule for the above flow shop problem using branch and bound technique.Also, determine the corresponding makespan.AppendixLO1
Consider the following 3 machines and 5 jobs flow shop problem.Job Processing Time Machine 1 Machine 2 Machine 3 1 7 4 3 2 9 5 8 3 5 1 7 4 6 2 5 5 10 3 4 Check whether Johnson's rule can be extended to this problem. If so, find the optimal schedule and the corresponding makespan.AppendixLO1
Consider the following 3 machines and 5 jobs flow shop problem. Check whether Johnson's rule can be extended to this problem. If so, what is the optimal schedule and the corresponding makespan?Job Machine 1 Machine 2 Machine 3 1 11 10 12 2 13 8 20 3 15 6 15 4 12 7 19 5 20 9 7 AppendixLO1
Consider the following 2 machines and 5 jobs flow shop scheduling problem. Using Johnson's algorithm, obtain the optimal sequence which will minimize the makespan.Job i Machine 1 Number 2 1 7 8 2 1 4 3 15 12 4 8 5 5 11 6 AppendixLO1
Consider the following 2 machines and 6 jobs flow shop problem.Job Machine 1 Machine 2 5 7 2 10 8 3 8 13 4 9 7 5 6 11 6 12 10 Obtain the optimal schedule and the corresponding makespan for the above problem.AppendixLO1
What are the assumptions in flow shop scheduling?AppendixLO1
Distinguish between single machine scheduling and flow shop scheduling.AppendixLO1
In Palmer's heuristic to minimize the makespan of the flow shop problem, the jobs are arranged as per the order of their slopes.(a) Decreasing (b) Increasing(c) Random (d) None of the above.AppendixLO1
In Palmer's heuristic to minimize the makespan of flow shop problem, the slope of each is computed.(a) Machine (b) Job(c) Both (a) and (b) (d) None of the above AppendixLO1
The number of iterations of CDS algorithm is equal to(a) The number of jobs minus one (b) The number of machines minus one(c) The number of jobs plus one (d) None of the above AppendixLO1
CDS algorithm gives(a) Infeasible solution (b) Optimal solution(c) Near optimal solution (d) None of the above AppendixLO1
CDS algorithm is an extension of(a) Hodgson's algorithm (b) Branch and Bound algorithm(c) Johnson's algorithm (d) None of the above AppendixLO1
In the branch and bound algorithm applied to minimize the makespan of the flow shop scheduling problem with m machines and n jobs, the lower bound computed w.r.t. to the machine m is given by the formula(a) bm = Latest completion time on machine m among the assigned jobs + amount of processing yet
In the branch and bound algorithm applied to minimize the makespan of the flow shop scheduling problem with m machines and n jobs, the lower bound of a node is the of the m lower bounds computed for that node.(a) Minimum (b) Average(c) Maximum (d) None of the above AppendixLO1
Ignall and Schrage developed branch and bound algorithm to minimize the makespan for scheduling problem.(a) Single machine (b) Flow shop(c) Job shop (d) None of the above AppendixLO1
In the branch and bound algorithm applied to minimize the makespan of the flow shop problem, the sequence is constructed(a) From left to right (b) From right to left(c) From mid to right (d) None of the above.AppendixLO1
The Johnson's rule can be extended to 3 machines and n jobs flow shop scheduling problem, if one of the following conditions is satisfied:(a) minimum processing time on machine 1 is more than the minimum processing time on machine 2 or maximum processing time on machine 3 is more than the minimum
The Johnson's rule can be extended to 3 machines and n jobs flow shop scheduling problem, if(a) Any one of the two conditions is satisfied(b) The two conditions are satisfied(c) The three conditions are satisfied(d) None of the above AppendixLO1
In flow shop scheduling, while using Johnson's rule, if there is a tie among the minimum processing times, there will be giving the optimal makespan.(a) One sequence (b) Many sequences(c) Infeasible sequence (d) None of the above AppendixLO1
In Johnson's rule, the sequence of jobs is constructed by assigning jobs to the positions in the sequence(a) Always from left to right (b) Always from right to left(c) From middle to right (d) None of the above AppendixLO1
Showing 2600 - 2700
of 5227
First
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
Last
Step by Step Answers
Get 50% OFF
Claim Now
