scientific article; zbMATH DE number 2163021
From MaRDI portal
Publication:4673408
Cited in
(23)- Scheduling with a minimum number of machines
- Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function
- Branch-price-and-cut for the mixed capacitated general routing problem with time windows
- Parameterized complexity of machine scheduling: 15 open problems
- Minimizing the number of machines with limited workload capacity for scheduling jobs with interval constraints
- An EPTAS for scheduling fork-join graphs with communication delay
- Robust online algorithms for dynamic choosing problems
- Efficient algorithms for scheduling parallel jobs with interval constraints in clouds
- Non-preemptive scheduling in a smart grid model and its implications on machine minimization
- Single courier single restaurant meal delivery (without routing)
- Online dynamic power management with hard real-time guarantees
- A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack
- Online bin packing with arbitrary release times
- Scheduling non-preemptible jobs to minimize peak demand
- An exact algorithm for non-preemptive peak demand job scheduling
- Improving fleet utilization for carriers by interval scheduling
- An O( m)-competitive algorithm for online machine minimization
- Exploring a resolution method based on an evolutionary game-theoretical model for minimizing the machines with limited workload capacity and interval constraints
- Throughput scheduling with equal additive laxity
- Throughput scheduling with equal additive laxity
- scientific article; zbMATH DE number 7764095 (Why is no real title available?)
- Fixed order scheduling with deadlines
- New algorithms for minimizing the weighted number of tardy jobs on a single machine
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4673408)
