This note considers a problem of minimum length scheduling for a set of messages subject to precedence constraints for switching and communication networks. The problem was first studied by Barcaccia, Bonuccelli, and Di Iannii. We consider a network with n inputs and n outputs. The messages to be sent are represented by an n × n matrix D =[d_(ij)], the traffic matrix, with nonnegative integer entries. Entry d_(ij) represents the number of messages to be sent from input i to output j.
展开▼
