Gladky A.A.

A.A. Gladky

Information about the author A.A. Gladky will soon be added to the site.
Found 1 papers in total
A two-machine preemptive openshop scheduling problem: An elementary proof of NP-completeness
A two-machine preemptive openshop scheduling problem: An elementary proof of NP-completeness
1997
This paper deals with a two-machine preemptive openshop system processing a set of...
Papers per page: