Solving job shop problems in the context of hypergraphs

A class of hypergraphs, called $B$ ‐tails, is introduced. It is shown that a certain hypergraph can be assigned to any job shop problem in such a way that minimal $B$ ‐tails correspond to optimal schedules. An algorithm for searching for a minimal $B$ ‐tail is described.