We introduce a parallel machine scheduling problem in which the processing times of jobs are not given in advance but are determined by a system of linear constraints. The objective is to minimize the makespan, i.e., the maximum job completion time among all feasible choices. This novel problem is motivated by various real-world application scenarios. We discuss the computational complexity and algorithms for various settings of this problem. In particular, we show that if there is only one machine with an arbitrary number of linear constraints, or there is an arbitrary number of machines with no more than two linear constraints, or both the number of machines and the number of linear constraints are fixed constants, then the problem is polynomial-time solvable via solving a series of linear programming problems. If both the number of machines and the number of constraints are inputs of the problem instance, then the problem is NP-Hard. We further propose several approximation algorithms for the latter case.

No abstract uploaded!

Starting with a commutative ring $R$ and an ideal $I$ , it is possible to define a family of rings $R(I)_{a,b}$ , with $a,b \in R$ , as quotients of the Rees algebra $\oplus_{n \geq0} I^{n}t^{n}$ ; among the rings appearing in this family we find Nagata’s idealization and amalgamated duplication. Many properties of these rings depend only on $R$ and $I$ and not on $a$ , $b$ ; in this paper we show that the Gorenstein and the almost Gorenstein properties are independent of $a$ , $b$ . More precisely, we characterize when the rings in the family are Gorenstein, complete intersection, or almost Gorenstein and we find a formula for the type.

No abstract uploaded!

No abstract uploaded!