The complexity of short schedules for uet bipartite graphs

Evripidis Bampis. The complexity of short schedules for uet bipartite graphs. RAIRO - Operations Research, 33(3):367-370, 1999. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.