Consider the following 5-job 4 machine flow shop makespan minimization problem i
ID: 371132 • Letter: C
Question
Consider the following 5-job 4 machine flow shop makespan minimization problem in which all jobs and machines are available at time zero and the flow of jobs is from machine 1 through machine 4 .
a)What is the number of all possible schedule?
b)What is the number of all possible permutation -type schedules?
c)Among all possible schedules,how many of them are enough to consider?
Now,consider the permutation-type schedules, answer the followings:
d)Using the CDS algorithm , determine a feasible schedule and its makespan
e)Using the machine Idle Time Method ,dtermine a feasible schedule and its makespan
f)Using Nawaz Heuristic,determine a feasible schedule and its makespan
g)Is there any of optimal schedule obtained by tge algorithms in parts (d) thorugh (f)? If yes , show the ciritical path(s) on the gantt chart of the optimal schedule?
Job Machine 1 Machine 2 Machine 3 Machine 4 1 18 2 28 16 2 14 23 3 11 3 25 25 22 26 4 29 5 6 1 5 7 15 25 16Explanation / Answer
Hi,
Thanks for the question.
4 P's define the marketing strategy for any company or for a particular brand. This is the strategy to reach and market the product to the customers.
The 4 P's will be:
Product: As mentioned, the product for this particular scenario will be McChicken and Big Mac.
Price: Price generally should be according to the perception of the customers to see its worth. They should consider to price the product moderately not on a low price because that would give the feel as the quality compromised.
Place: That should be very evenly distributed across the outlets in the US. The product will be very popular so the company should be very efficient in the distribution.
Promotions: Mcdonald's is very aggressive in terms of the advertising mostly in the Tv advertisement or OOH branding.
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.