The following pages link to Marek Mika (Q213365):
Displaying 14 items.
- An almost optimal heuristic for preemptive \(C_{\text{max}}\) scheduling of dependent tasks on parallel identical machines (Q596461) (← links)
- Project scheduling with finite or infinite number of activity processing modes -- a survey (Q621683) (← links)
- Modelling and solving grid resource allocation problem with network resources for workflow applications (Q640301) (← links)
- Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs (Q1293204) (← links)
- Local search metaheuristics for discrete-continuous scheduling problems (Q1296094) (← links)
- Solving the discrete-continuous project scheduling problem via its discretization (Q1401646) (← links)
- Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models (Q1767683) (← links)
- A heuristic approach to allocating the continuous resource in discrete--continuous scheduling problems to minimize the makespan (Q1860373) (← links)
- Tabu search for multi-mode resource-constrained project scheduling with schedule-dependent setup times (Q2467268) (← links)
- (Q3426432) (← links)
- (Q4240868) (← links)
- (Q4433443) (← links)
- Simulated annealing for multi-mode resource-constrained project scheduling (Q5948198) (← links)
- Scheduling of network tasks to minimize the consumed energy (Q6070417) (← links)
