scientific article; zbMATH DE number 2163021
From MaRDI portal
zbMath1161.68360MaRDI QIDQ4673408
Erlebach, Thomas, Mark Cieliebak, Fabian Hennecke, Birgitta Weber, Peter Widmayer
Publication date: 29 April 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
New algorithms for minimizing the weighted number of tardy jobs on a single machine, Scheduling non-preemptible jobs to minimize peak demand, Efficient algorithms for scheduling parallel jobs with interval constraints in clouds, Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function, An $\mathcal{O}(\log {m})$-Competitive Algorithm for Online Machine Minimization, A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack, An Exact Algorithm for Non-preemptive Peak Demand Job Scheduling, Exploring a Resolution Method Based on an Evolutionary Game-Theoretical Model for Minimizing the Machines with Limited Workload Capacity and Interval Constraints, Improving fleet utilization for carriers by interval scheduling, Non-preemptive scheduling in a smart grid model and its implications on machine minimization, Unnamed Item, Minimizing the number of machines with limited workload capacity for scheduling jobs with interval constraints, Online bin packing with arbitrary release times, Branch-price-and-cut for the mixed capacitated general routing problem with time windows, An EPTAS for scheduling fork-join graphs with communication delay, Parameterized complexity of machine scheduling: 15 open problems, Throughput scheduling with equal additive laxity, Single courier single restaurant meal delivery (without routing), Throughput scheduling with equal additive laxity, Scheduling with a minimum number of machines, Online dynamic power management with hard real-time guarantees, Robust online algorithms for dynamic choosing problems
