The solution algorithms for the multiprocessor scheduling with workspan criterion

Authors:
RadosłAw Rudek;Agnieszka Rudek;Andrzej Kozik
Affiliations:
Wrocław University of Economics, Komandorska 118/120, 53-345 Wrocław, Poland;Wrocław University of Technology, Wyb. Wyspiańskiego 27, 50-370 Wrocław, Poland;Wrocław University of Technology, Wyb. Wyspiańskiego 27, 50-370 Wrocław, Poland
Venue:
Expert Systems with Applications: An International Journal
Year:
2013

Citing 12
Cited 0

Scheduling independent 2-processor tasks to minimize schedule length

Information Processing Letters - Lecture Notes in Computer Science, no. 173
Complexity of scheduling parallel task systems

SIAM Journal on Discrete Mathematics
Scheduling parallelizable tasks: putting it all on the shelf

SIGMETRICS '92/PERFORMANCE '92 Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Single-machine scheduling problems with start-time dependent processing time

Computers & Mathematics with Applications
Time-Dependent Scheduling

Time-Dependent Scheduling
Single machine scheduling with decreasing linear deterioration under precedence constraints

Computers & Mathematics with Applications
The common due-date early/tardy scheduling problem on a parallelmachine under the effects of time-dependent learning and linear and nonlinear deterioration

Expert Systems with Applications: An International Journal
A fast metaheuristic for scheduling independent tasks with multiple modes

Computers and Industrial Engineering
Single-machine scheduling with a nonlinear deterioration function

Information Processing Letters
A note on the learning effect in multi-agent optimization

Expert Systems with Applications: An International Journal
An effective approximation algorithm for the Malleable Parallel Task Scheduling problem

Journal of Parallel and Distributed Computing
A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis

Operations Research Letters

Quantified Score

Hi-index	12.05

Visualization

Abstract

In this paper, we consider multiprocessor scheduling problems, where each job (task) must be executed simultaneously by the specified number of processors, but the indices of the processors allotted to each job do not have to be contiguous (i.e., jobs can be fragmentable). Unlike other research in this domain, we analyse the problem under the workspan criterion, which is defined as the product of the maximum job completion time (makespan) and the number of used processors. Moreover, the job processing times can be described by non-increasing or non-decreasing functions dependent on the start times of jobs that model improvement (learning) or degradation (deteriorating), respectively. To solve the problems, we construct some polynomial time algorithms and analyse numerically their efficiency.