Scheduling jobs with values dependent on their completion times

► We consider scheduling problems with job values dependent on the completion times. ► In the first problem we consider stepwise values in a parallel processor environment. ► The second problem is single processor with piecewise linear losses of job values. ► We prove strong NP-hardness, construct pseudopolynomial algorithms for the problems. ► We also construct and experimentally compare heuristics for the problems.