Cepek O.

O. Cepek

Information about the author O. Cepek will soon be added to the site.
Found 2 papers in total
Nonpreemptive open shop with restricted processing times
1994
A polynomial time algorithm was given by Fiala for the nonpreemptive m- processor open...
Minimizing the number of grab’s changes in a single machine scheduling problem
1989
N operations subject to precedence constraints are to be sequenced on a single...
Papers per page: