Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

Q1/ Does the parallel machine consider as a special case of flow shop? Q2/ For W

ID: 454852 • Letter: Q

Question

Q1/ Does the parallel machine consider as a special case of flow shop?

Q2/ For Weighted problem of parallel machine, If w=2 needs more time ( the RCT is negative ) , the negative number will be subtracted from RCT of w = 1 ?

Q3/ What is the difference between dependent shop and job shop and can you give examples

Q4/ why minimising the makespan for flow shop problems equals to minimising the idle time and the jobs waiting time?

Q5/ Do the hueristics methods consider as static or dynamic ?

Q6/ Why Dynamic methods are better than static methods in sequancing and scheduling ?

Explanation / Answer

Q1/ Does the parallel machine consider as a special case of flow shop?

No, It’s simply termed as Flow Shop with Parallel Machines (FSPM)

Q2/ For Weighted problem of parallel machine, If w=2 needs more time (the RCT is negative), the negative number will be subtracted from RCT of w = 1?

Question is not clear

Q3/ What is the difference between dependent shop and job shop and can you give examples

In job shop, order of jobs is independent of other jobs, whereas in dependent shop, order of jobs is dependent on other jobs. An example of dependent shop is a shop doing denting and painting of cars. Here the order of jobs is dependent in the sense that denting is followed by painting, so painting is a dependent job.

Q4/ why minimizing the make span for flow shop problems equals to minimizing the idle time and the jobs waiting time?

Make span is the time from start of first job until the end of last job. Any reduction in make span has a direct impact on idle time / waiting time

Q5/ Do the heuristics methods consider as static or dynamic?

Heuristic methods can be both static as well as dynamic