Preemptive and non-preemptive scheduling on two unrelated parallel machines
type: Item
instance of: scholarly article
title: Preemptive and non-preemptive scheduling on two unrelated parallel machines
zbMATH Open document ID: 1501.90034
author: V. A. Strusevich
author: Alan J. Soper
published in: Journal of Scheduling
publication date: 2022-11-04T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 7612467
zbMATH Keywords: unrelated parallel machines
zbMATH Keywords: power of preemption
zbMATH Keywords: quality of a single preemption
MaRDI profile type: Publication
full work available at URL: s10951-022-00753-7
OpenAlex ID: W4296962586
cites work: Parallel Processor Scheduling with Limited Number of Preemptions
cites work: Q4821818
cites work: The power of preemption on unrelated machines and applications to scheduling orders
cites work: The benefit of preemption for single machine scheduling so as to minimize total weighted completion time
cites work: Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines
cites work: Optimal Preemptive Scheduling of Two Unrelated Processors
cites work: Preemptive Scheduling of Uniform Processor Systems
cites work: Algorithms with limited number of preemptions for scheduling on parallel machines
cites work: On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
cites work: Approximation algorithms for scheduling unrelated parallel machines
cites work: Scheduling with deadlines and loss functions
cites work: Analysis of a linear programming heuristic for scheduling unrelated parallel machines
cites work: Parallel Machine Scheduling: Impact of Adding Extra Machines
cites work: An optimal rounding gives a better approximation for scheduling unrelated machines
cites work: On the geometry, preemptions and complexity of multiprocessor and shop scheduling
cites work: An approximation algorithm for the generalized assignment problem
cites work: Approximability of average completion time scheduling on unrelated machines
cites work: Single parameter analysis of power of preemption on two and three uniform machines
cites work: Power of Preemption on Uniform Parallel Machines
cites work: Schedules with a single preemption on uniform parallel machines
cites work: Parametric analysis of the quality of single preemption schedules on three uniform parallel machines
cites work: A comment on scheduling on uniform machines under chain-type precedence constraints
DOI: 10.1007/S10951-022-00753-7
description: scientific article; zbMATH DE number 7612467