По вашему запросу найдено документов: 10724
Страница 2 из 1073
Two-machine shop scheduling with zero and unit processing times for the flow shop problem and the corresponding two parallel identical machine problem. For all problems O
Scheduling algorithms for automatic control systems for technological processes gain will be maximal. For this purpose task (jobs or operations), scheduling techniques for the multi-machine
Scheduling algorithms for automatic control systems for technological processes gain will be maximal. For this purpose task (jobs or operations), scheduling techniques for the multi-machine
Asynchronous parallel programming language based on the microsoft.NET platform operation a copying operation for the object which is scheduled for execution on remote machine. This copy
Asynchronous parallel programming language based on the Microsoft .NET platform operation a copying operation for the object which is scheduled for execution on remote machine. This copy
Schedule execution for two-machine flow-shop with interval processing times decision framework by considering a two-machine flow-shop scheduling problem in which each uncertain
Minimizing functions of infeasibilities in a two-machine flow shop that the permutation version of this problem is equivalent
to a single machine scheduling problem of minimizing
MC#: asynchronous parallel programming language for cluster- and GRID-architectures operation a copying operation for the object which is scheduled for execution on remote machine. This copy
Single machine scheduling problem with interval processing times and total completion time objectiveWe consider a single machine scheduling problem with uncertain durations of the given jobs
The optimality region for a single-machine scheduling problem with bounded durations of the jobs and the total completion time оbjectiveWe study a single-machine scheduling problem to minimize the total completion time of the given set
Страница 2 из 1073
Фасеты
Партнеры
Индексация
