Planning

Scheduling problems originating in "production planning" have been studied. In particular, a new approach, based on hypergraphs, has been proposed for determining an optimal assembly planning [GP92]. An approximate algorithm, improving the ones existing in the literature, has been found for the scheduling of jobs on two machines in the case of tree-precedence relationships [GP97] [G93].

[GP97] G. Gallo, F. Piccinonno "A 1/4 approximate algorithm for P2/tree/Cmax" Discrete Applied Mathematics 72, p. 85-98, 1997

[G93] G. Gallo, "A 1/4 approximate algorithm for P2/tree/Cmax", Workshop on Models and Algorithms for Planning and Scheduling Problems, Villa Vigoni, Como, 1993.

[GP92] G. Gallo, S. Pallottino "Hypergraph models and algorithms for the assembly problem" TR 6/92 Dip. di Informatica, Univ. di Pisa, 1992