In the dynamic programming implementation of the assembly line scheduling problem, how many lookup tables are required?
(a) 0
(b) 1
(c) 2
(d) 3
This question was posed to me during an interview.
This intriguing question comes from Assembly Line Scheduling in section Dynamic Programming of Data Structures & Algorithms II