Pages that link to "Item:Q551193"
From MaRDI portal
The following pages link to On the complexity of interval scheduling with a resource constraint (Q551193):
Displaying 9 items.
- Optimal interval scheduling with a resource constraint (Q337149) (← links)
- Distributionally robust fixed interval scheduling on parallel identical machines under uncertain finishing times (Q1651660) (← links)
- Flow-based formulations for operational fixed interval scheduling problems with random delays (Q1789616) (← links)
- Strategy-proof mechanism for online resource allocation in cloud and edge collaboration (Q2118409) (← links)
- A branch-and-price algorithm for the temporal bin packing problem (Q2337386) (← links)
- Scheduling the two-machine open shop problem under resource constraints for setting the jobs (Q2449360) (← links)
- A combinatorial auction mechanism for time-varying multidimensional resource allocation and pricing in fog computing (Q6093434) (← links)
- A Lagrangian relaxation algorithm for stochastic fixed interval scheduling problem with non-identical machines and job classes (Q6551145) (← links)
- Multithread interval scheduling with flexible machine availabilities: complexity and efficient algorithms (Q6611071) (← links)
