2. Consider the following 5-job 4-machine flowshop makespan minimization problem

Question

2. Consider the following 5-job 4-machine flowshop 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 Job MachineMachine 2 Machine 3Machine 4 18 14 25 29 28 23 25 26 25 16 1/2 (a) What is the number of all possible schedules? (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 Machine Idle Time Method, determine 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 the algorithms in parts (d) through (f)? If yes, show the critical path(s) on the Gantt chart of the optimal schedule.

Explanation / 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

Navigate

• Browse (All)
• Browse 2
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.