ObjectiveMcq
Print Protected
This page is protected for print. Use the website to view the content.
In the dynamic programming implementation of the assembly line scheduling problem, how many lookup tables are required?
Correct Answer: C — 2
In the dynamic programming implementation of the assembly line scheduling problem, 2 lookup tables are required one for storing the minimum time and the other for storing the assembly line number.