Publication Date



Technical Report: UTEP-CS-18-26

To appear in Proceedings of the 11th International Workshop on Constraint Programming and Decision Making CoProd'2018, Tokyo, Japan, September 10, 2018


When a company works on a large software project, it can often start recouping its investments by selling intermediate products with partial functionality. With this possibility in mind, it is important to schedule work on different software parts so as to maximize the profit. These exist several algorithms for solving the corresponding optimization problem, and in all the resulting plans, at each moment of time, we work on one part of software at a time. In this paper, we prove that this one-part-at-a-time property holds for all optimal plans.