Integrality Property in Preemptive Parallel Machine Scheduling
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Properties of optimal schedules in preemptive shop scheduling
Discrete Applied Mathematics
Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop
Mathematical and Computer Modelling: An International Journal
The bipartite margin shop and maximum red matchings free of blue-red alternating cycles
Discrete Optimization
Bounding the running time of algorithms for scheduling and packing problems
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
| Hi-index | 0.01 |