Solving sparse linear systems can lead to processing tree workflows on a platform of processors. In this study, we use the model of malleable tasks motivated in [1, 9] in order to study tree workflow schedules under two contradictory objectives: makespan minimization and memory minization. First, we give a simpler proof of the result of [8] which allows to compute a makespan-optimal schedule fo...

We study the problem of contention resolution for differentsized jobs on a simple channel. When a job makes a run attempt, it learns only whether the attempt succeeded or failed. We first analyze binary exponential backoff, and show that it achieves a makespan of V 2 √ log n) with high probability, where V is the total work of all n contending jobs. This bound is significantly larger than when ...

In this paper we consider the problem of scheduling on computing platforms composed of several independent organizations, known as the Multi-Organization Scheduling Problem (MOSP). Each organization provides both resources and tasks and follows its own objectives. We are interested in the best way to minimize the makespan on the entire platform when the organizations behave in a selfish way. We...

MapReduce is a popular parallel computing paradigm for Big Data processing in clusters and data centers. It is observed that different job execution orders and MapReduce slot configurations for a MapReduce workload have significantly different performance with regarding to the makespan, total completion time, system utilization and other performance metrics. There are quite a few algorithms on ...

Heuristic best-first search techniques have recently enjoyed ever-increasing scalability in finding satisficing solutions to a variety of automated planning problems, and temporal planning is no different. Unfortunately, achieving efficient computational performance often comes at the price of clear guidance toward solution of high quality. This fact is sharp in the case of many best-first sear...

The PEGS (Production and Environmental Generic Scheduler) program is a new generic scheduling program for manufacturing companies. It includes sort and search algorithms and can operate on the basis of elapsed time or economic values. Program performance is compared to a series of published benchmarks. The case study presented here illustrates the use of PEGS for a flow shop configuration at a ...

Batch processing is becoming more important in the process industries, because of the increasing product variety and the decreasing demand volumes for individual products. In batch process industries it is difficult to estimate the completion time, or makespan, of a set of jobs, because jobs interact at the shop floor. We assume a situation with hierarchical production control consisting of a p...

Suppose that a set of weighted tasks shall be assigned to a set of machines with possibly different speeds such that the load is distributed evenly among the machines. In computer science, this problem is traditionally treated as an optimization problem. One of the classical objectives is to minimize the makespan, i.e., the maximum load over all machines. Here we study a natural game theoretic ...

This paper presents an MILP model for the permutation flowshop wherein the setup times are both separable from the job processing times and independent of a job’s position in the processing sequence. Two experiments were conducted to estimate the computer times necessary to solve problems with up to 9 machines and 15 jobs, and to then compare these solution time requirements to those required ...

We have a set J of n jobs, and a set M of m machines. The processing time of job i is pij on machine j. Let f : J ←M be a function that assigns each job to exactly one machine. The makespan of f is max1≤j≤m ∑ i:f(i)=j pij , where ∑ i:f(i)=j pij is the total processing time of the jobs that are assigned to machine j. In the Scheduling on Unrelated Parallel Machines problem, the goal is to find a...