Mika Marek

Marek Mika

Information about the author Marek Mika will soon be added to the site.
Found 8 papers in total
Modelling and solving grid resource allocation problem with network resources for workflow applications
Modelling and solving grid resource allocation problem with network resources for workflow applications
2011
A problem of allocating resources of a grid to workflow applications is considered....
Project scheduling with finite or infinite number of activity processing modes ‐ A survey
Project scheduling with finite or infinite number of activity processing modes ‐ A survey
2011
This paper surveys single-project, single-objective, deterministic project scheduling...
Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models
Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models
2005
In this paper the multi-mode resource-constrained project scheduling problem with...
An almost optimal heuristic for preemptive Cmax scheduling of dependent tasks on parallel identical machines
An almost optimal heuristic for preemptive Cmax scheduling of dependent tasks on parallel identical machines
2004
We consider the problem of scheduling preemptive, dependent tasks on parallel,...
A heuristic approach to allocating the continuous resource in discrete–continuous scheduling problems to minimize the makespan
A heuristic approach to allocating the continuous resource in discrete–continuous scheduling problems to minimize the makespan
2002
A problem of scheduling jobs on parallel, identical machines under an additional...
Simulated annealing for multi-mode resource-constrained project scheduling
Simulated annealing for multi-mode resource-constrained project scheduling
2001
In this paper the resource-constrained project scheduling problem with multiple...
Discrete–continuous scheduling to minimize the makespan for power processing rates of jobs
Discrete–continuous scheduling to minimize the makespan for power processing rates of jobs
1999
A class of discrete–continuous scheduling problems is considered when each...
Local search metaheuristics for discrete continuous scheduling problems
Local search metaheuristics for discrete continuous scheduling problems
1998
Problems of scheduling nonpreemptable jobs which require simultaneously a machine from...
Papers per page: