A linear time-cost tradeoff problem with multiple interim assessments within multiple projects in parallel. (February 2019) - Choi, Byung-Cheon
Highlights: We consider a project scheduling problem in which the jobs can be compressed. The project consists of multiple subprojects with completely ordered jobs. The objective is to minimize the total tardiness penalty and compression cost. We develop a strongly polynomial time algorithm. Abstract: We consider a project scheduling problem in which the jobs can be compressed by using additional resources to meet the corresponding due dates. The project consists of multiple independent subprojects with completely ordered jobs. Some jobs have their own due dates for interim assessments of whole project. A penalty cost arises from the tardiness of a job, but it can be avoided through the compression of some jobs, which requires an additional cost. The objective is to minimize the total tardiness penalty and compression costs. We investigate optimality properties and develop an algorithm to find an optimal schedule in strongly polynomial time.