Problem: You have n project assignments to be completed. Assume that: • Each assignment has its own estimated time taken to be completed, and different honorarium. • You have limited time (e.g.: only several fixed hours at night per day, 5 days per week, and not all can be completed until the 5th day) You can work on any assignment in any sequence • Incomplete assignment can be carried on to the next week. You can still get a part of the honorarium of the incomplete assignment (based on the calculation). Design an algorithm to schedule your assignments in this limited time with maximum total honorarium: Explain through your own (interesting) example. Show your calculation and pseudocode.
Previous question