The minimum-cost arborescence problem is a well-studied in the area of graph theory, with known polynomial-time algorithms for solving it. Previous literature introduced new variations on original different objective function and/or constraints. Recently, Precedence-Constrained Minimum-Cost Arborescence was proposed, which precedence constraints are enforced pairs vertices. These prevent format...

In this paper we consider the labor constrained scheduling problem (LCSP), in which a set of jobs to be processed is subject to precedence and labor requirement constraints. Each job has a speciied processing time and a labor requirements proole, which typically varies as the job is processed. Given the amount of labor available at each period, the problem consists in determining starting times...

This study proposes an exact algorithm for the precedence-constrained singlemachine scheduling problem to minimize total job completion cost where machine idle time is forbidden. The proposed algorithm is an extension of the authors’ previous algorithms for the problem without precedence-constraints and is based on the SSDP (Successive Sublimation Dynamic Programming) method. Numerical experime...

Construction and facilities maintenance projects involve a large number of people and tasks with resource constraints and precedence constraints. This paper presents a new approach to model this problem as a resource-constrained multi-project scheduling problem (RCMPSP) with cost minimization. The scheduling problem is first decomposed into two sub-problems: schedule generation and sequencing. ...