Algorithms for Hierarchical and Semi-Partitioned Parallel Scheduling

We propose a model for scheduling jobs in a parallel machine setting that takes into account the cost of migrations by assuming that the processing time of a job may depend on the specific set of machines among which the job is migrated. For the makespan minimization objective, the model generalizes classical scheduling problems such as unrelated parallel machine scheduling, as well as novel ones such as semi-partitioned and clustered scheduling. In the case of a hierarchical family of machines, we derive a compact integer linear programming formulation of the problem and leverage its fractional relaxation to obtain a polynomial-time 2-approximation algorithm. Extensions that incorporate memory capacity constraints are also discussed

An investigation into approximate solutions for deterministic and stochastic multi-dimensional sequencing

A description is given of an investigation in detail into the validity of the overlap integral method for describing planar optical waveguide junctions. A comparison between the results of this method and that of a rigorous mode-matching approach is taken

ILP-based approaches to partitioning recurrent workloads upon heterogeneous multiprocessors

The problem of partitioning systems of independent constrained-deadline sporadic tasks upon heterogeneous multiprocessor platforms is considered. Several different integer linear program (ILP) formulations of this problem, offering different tradeoffs between effectiveness (as quantified by speedup bound) and running time efficiency, are presented

Constraint Centric Scheduling Guide

The advent of architectures with software-exposed resources (Spatial Architectures) has created a demand for universally applicable scheduling techniques. This paper describes our generalized spatial scheduling framework, formulated with Integer Linear Programming, and specifically accomplishes two goals. First, using the ?Simple? architecture, it illustrates how to use our open-source tool to create a customized scheduler and covers problem formulation with ILP and GAMS. Second, it summarizes results on the application to three real architectures (TRIPS,DySER,PLUG), demonstrating the technique?s practicality and competitiveness with existing schedulers

Scheduling microCHPs in a group of houses

The increasing penetration of renewable energy sources, the demand for more energy efficient electricity production and the increase in distributed electricity generation causes a shift in the way electricity is produced and consumed. The downside of these changes in the electricity grid is that network stability and controllability become more difficult compared to the old situation. The new network has to accommodate various means of production, consumption and buffering and needs to offer control over the energy flows between these three elements.\ud In order to offer such a control mechanism we need to know more about the individual aspects. In this paper we focus on the modelling of distributed production. Especially, we look at the use of microCHP (Combined Heat and Power) appliances in a group of houses.\ud The problem of planning the production runs of the microCHP is modelled via an ILP formulation, both for a single house and for a group of houses.\u