Bounds for Certain Multiprocessing Anomalies

Cited in

(only showing first 100 items - show all)

Fast payment schemes for truthful mechanisms with verification
Coordination mechanisms for selfish scheduling
Preemptive online scheduling: Optimal algorithms for all speeds
Optimal and heuristic solution methods for a multiprocessor machine scheduling problem
Online scheduling on two uniform machines to minimize the makespan
Combinatorial algorithms for data migration to minimize average completion time
Online scheduling with general machine cost functions
Priority algorithms for the subset-sum problem
Scheduling jobs with time-resource tradeoff via nonlinear programming
Maximizing the minimum load for selfish agents
Scheduling interfering job sets on parallel machines
An introduction to the analysis of approximation algorithms
Optimal distribution strategies with cyclic demands
A heuristic algorithm for a pseudo-cyclic delivery problem under window constraints
Multiprocessor scheduling: Combining LPT and MULTIFIT
Anomalous behavior in bin packing algorithms
A heuristic for preemptive scheduling with set-up times
Resource constrained scheduling as generalized bin packing
Semi on-line algorithms for the partition problem
Heuristics for unrelated machine scheduling with precedence constraints
The \(k\)-partitioning problem
Optimal scheduling on parallel machines for a new order class
Performance of scheduling algorithms for no-wait flowshops with parallel machines
Worst-case analysis of heuristics for open shops with parallel machines
A note on generalizing the maximum lateness criterion for scheduling
Tabu search for the job-shop scheduling problem with multi-purpose machines
A better lower bound for on-line scheduling
On-line load balancing
Dynamic scheduling on parallel machines
A lower bound for randomized on-line scheduling algorithms
Heuristics for parallel machine scheduling with delivery times
Sensitivity analysis of list scheduling heuristics
Minimizing makespan in hybrid flowshops
Scheduling with incompatible jobs
List scheduling algorithms to minimize the makespan on identical parallel machines
Approximate algorithms for the \(P\parallel C_{\max}\) problem
On the existence of schedules that are near-optimal for both makespan and total weighted completion time
1-optimality of static BSP computations: Scheduling independent chains as a case study.
When greediness fails: examples from stochastic scheduling.
On-line algorithms for the channel assignment problem in cellular networks.
The optimal on-line parallel machine scheduling
Resource augmentation in load balancing.
New algorithms for related machines with temporary jobs.
Applying extra-resource analysis to load balancing.
Scheduling multiple variant programs under hard real-time constraints
Restarts can help in the on-line minimization of the maximum delivery time on a single machine
On-line scheduling revisited
On-line scheduling with precedence constraints
On an on-line scheduling problem for parallel jobs
A manifesto for the computational method
A note on on-line scheduling with precedence constraints on identical machines
Online-bounded analysis
A survey on makespan minimization in semi-online environments
New strategies for stochastic resource-constrained project scheduling
Discrete parallel machine makespan ScheLoc problem
Improved lower bounds for online scheduling to minimize total stretch
Multiprofessor scheduling
Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities
Online MapReduce processing on two identical parallel machines
Bounds for parallel machine scheduling with predefined parts of jobs and setup time
Multi-machine scheduling with interval constrained position-dependent processing times
Minimizing the makespan on two identical parallel machines with mold constraints
Block rearranging elements within matrix columns to minimize the variability of the row sums
Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times
Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan
Algorithms better than LPT for semi-online scheduling with decreasing processing times
On one problem of construction of energy-saving schedules
Scheduling jobs on identical machines with agreement graph
Online scheduling of two job types on a set of multipurpose machines with unit processing times
Minimizing the maximum starting time on-line
Minimizing makespan with release times on identical parallel batching machines
Pseudo lower bounds for online parallel machine scheduling
Variable neighborhood descent applied to multi-way number partitioning problem
Parallel machine scheduling with nested processing set restrictions and job delivery times
Polynomial time approximation algorithms for machine scheduling: Ten open problems
An approximation algorithm for scheduling trees of malleable tasks
On-line restricted assignment of temporary tasks with unknown durations.
Off-line temporary tasks assignment.
Delayed information and action in on-line algorithms
Optimal preemptive semi-online scheduling to minimize makespan on two related machines
Algorithms for dynamic scheduling of unit execution time tasks
Approximation schemes for parallel machine scheduling problems with controllable processing times
A note on on-line scheduling with partial information
New lower and upper bounds for on-line scheduling
Coordination mechanisms for parallel machine scheduling
Offline file assignments for online load balancing
Approximability of scheduling with fixed jobs
Scheduling tree-like task systems with non-uniform deadlines subject to unit-length communication delays
Scheduling In the random-order model
On scheduling multiple two-stage flowshops
Can the agent with limited information solve travelling salesman problem?
An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time
Approximation algorithms for the multiprocessor scheduling with submodular penalties
On the price of anarchy of two-stage machine scheduling games
Starting time minimization for the maximum job variant
Makespan minimization with OR-precedence constraints
An asymptotically tight online algorithm for \(m\)-steiner traveling salesman problem
Speed-robust scheduling. Sand, bricks, and rocks
Online makespan scheduling with job migration on uniform machines
A 2-competitive largest job on least loaded machine online algorithm based on the multi list scheduling model

This page was built for publication: Bounds for Certain Multiprocessing Anomalies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5555416)