Results 241 to 250 of about 13,809 (278)

Analysis and Improvement of Makespan and Utilization for MapReduce

2013 IEEE 10th International Conference on High Performance Computing and Communications & 2013 IEEE International Conference on Embedded and Ubiquitous Computing, 2013
A MapReduce cluster is usually shared by multiple users or products, aiming at accelerating their own job. In contrast, the utilization of the cluster is the main concern for the system itself. MapReduce jobs are split into independent tasks during execution.
Yin Li, Chuang Lin 0002, Fengyuan Ren
openaire   +1 more source

Minimizing Makespan on Identical Parallel Machines

International Journal of Operations Research and Information Systems, 2015
A heuristic algorithm that uses iteratively LPT and MF approaches on different job and machine sets constructed by using the current solution is developed to solve a classical multiprocessor scheduling problem with the objective of minimizing the makespan.
Kuruvilla A, PALETTA, Giuseppe
openaire   +1 more source

Makespan minimization in machine dominated flowshop

Applied Mathematics and Computation, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gopalakrishnan Easwaran, Larry E. Parten, Rafael Moras, Paul X. Uhlig   +3 more
openaire   +2 more sources

Makespan minimization for multiple uniform machines

Computers & Industrial Engineering, 2008
We consider a classical scheduling problem with makespan minimization on uniform parallel machines. From the viewpoint of workload, instead of completion time, two important theorems are developed for the problem. The first theorem provides an improved lower bound as the starting point for the search, and the second theorem further accelerates the ...
Lin, C. H., Liao, C. J.
openaire   +2 more sources

Online Makespan Minimization with Budgeted Uncertainty

2021
We study Online Makespan Minimization with uncertain job processing times. Jobs are assigned to m parallel and identical machines. Preemption is not allowed. Each job has a regular processing time while up to \(\varGamma \) jobs fail and require additional processing time.
Susanne Albers, Maximilian Janke
openaire   +1 more source

Bounding the Makespan of Transaction Schedules.

The performance of transactional database systems is typically evaluated by measuring the amount of transactions they can commit to the database per second. However, fairly measuring this for the same workload on different systems is not trivial. It is therefore relevant to formalize schedule efficiency, investigate the space of all possible efficient ...
Tim Baccaert, Brecht Vandevoort, Bas Ketsman   +2 more
openaire   +2 more sources

Minimizing the Makespan in Flowshops with Flexible Operations

IFAC Proceedings Volumes, 2012
We consider a flowshop with m machines each of which perform a specific operation of the identical parts to be processed. Two specific adjacent machines among all machines are capable of performing an additional operation required by each part, which is named as the flexible operation.
Gültekin H., Demirtaş H. H.
openaire   +2 more sources

Minimization of Makespan Quantiles

2011
In this chapter, we consider temporal networks whose task durations are functions of a resource allocation that can be chosen by the decision maker. The goal is to find a feasible resource allocation that minimizes the network’s makespan. We focus on non-renewable resources, that is, the resources are not replenished, and specified resource budgets ...
openaire   +1 more source

Recent Results for Online Makespan Minimization

2013
Overview: We study a classical scheduling problem that has been investigated for more than forty years. Consider a sequence of jobs σ = J 1, …, J n that has to be scheduled on m identical parallel machines. Each job J t has an individual processing time p t , 1 ≤ t ≤ n. Preemption of jobs is not allowed. The goal is to minimize the makespan, i.e.
openaire   +1 more source

Minimizing Makespan for the Lazy Bureaucrat Problem

2002
We study the problem of minimizing makespan for the Lazy Bureaucrat Scheduling Problem. We give a pseudopolynomial time algorithm for a preemptive scheduling problem, resolving an open problem by Arkin et al. We also extend the definition of Lazy Bureaucrat scheduling to the multiple-bureaucrat (parallel) setting, and provide pseudopolynomial-time ...
Clint Hepner, Clifford Stein 0001
openaire   +1 more source