| Article ID: | iaor20001731 |
| Country: | France |
| Volume: | 31 |
| Issue: | 1 |
| Start Page Number: | 73 |
| End Page Number: | 101 |
| Publication Date: | Jan 1997 |
| Journal: | RAIRO Operations Research |
| Authors: | Bendali F., Quilliot A. |
| Keywords: | scheduling, programming: integer |
We first deal with the problem which consists in finding a linear ordering of the vertices of a partially ordered hypergraph H in a way which minimizes the number of ‚breaks’ in the edges of H. We present two applications of this problem; the first one is related to scheduling and the second one to integer linear programming. In the second part of this paper, we characterize interval graphs whose edges are oriented in order to represent inclusion, overlapping and anteriority relationships.