Pages that link to "Item:Q1015305"
From MaRDI portal
The following pages link to Scheduling with a minimum number of machines (Q1015305):
Displaying 10 items.
- Minimizing the number of machines for scheduling jobs with equal processing times (Q1042179) (← links)
- Minimizing the number of machines for minimum length schedules (Q1042210) (← links)
- Cost-efficient scheduling on machines from the cloud (Q1631672) (← links)
- Scheduling with limited machine availability (Q1969884) (← links)
- Minimizing the number of machines with limited workload capacity for scheduling jobs with interval constraints (Q1985052) (← links)
- Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network (Q2197321) (← links)
- A greedy approximation algorithm for minimum-gap scheduling (Q2400437) (← links)
- An $\mathcal{O}(\log {m})$-Competitive Algorithm for Online Machine Minimization (Q4561244) (← links)
- A Greedy Approximation Algorithm for Minimum-Gap Scheduling (Q4924641) (← links)
- Exploring a Resolution Method Based on an Evolutionary Game-Theoretical Model for Minimizing the Machines with Limited Workload Capacity and Interval Constraints (Q5357764) (← links)
