The following pages link to (Q4673408):
Displaying 22 items.
- Improving fleet utilization for carriers by interval scheduling (Q439488) (← links)
- New algorithms for minimizing the weighted number of tardy jobs on a single machine (Q829184) (← links)
- Scheduling with a minimum number of machines (Q1015305) (← links)
- Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function (Q1652513) (← links)
- Branch-price-and-cut for the mixed capacitated general routing problem with time windows (Q1754228) (← links)
- Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
- Minimizing the number of machines with limited workload capacity for scheduling jobs with interval constraints (Q1985052) (← links)
- An EPTAS for scheduling fork-join graphs with communication delay (Q1998847) (← links)
- Robust online algorithms for dynamic choosing problems (Q2117763) (← links)
- Efficient algorithms for scheduling parallel jobs with interval constraints in clouds (Q2149869) (← links)
- Non-preemptive scheduling in a smart grid model and its implications on machine minimization (Q2211351) (← links)
- Single courier single restaurant meal delivery (without routing) (Q2294375) (← links)
- Online dynamic power management with hard real-time guarantees (Q2354765) (← links)
- A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack (Q2400435) (← links)
- Online bin packing with arbitrary release times (Q2474079) (← links)
- Scheduling non-preemptible jobs to minimize peak demand (Q2633192) (← links)
- An Exact Algorithm for Non-preemptive Peak Demand Job Scheduling (Q2942377) (← links)
- An $\mathcal{O}(\log {m})$-Competitive Algorithm for Online Machine Minimization (Q4561244) (← 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)
- Throughput scheduling with equal additive laxity (Q5918523) (← links)
- Throughput scheduling with equal additive laxity (Q5925675) (← links)
- (Q6068238) (← links)
