On the geometry, preemptions and complexity of multiprocessor and shop scheduling
type: Item
instance of: scholarly article
title: On the geometry, preemptions and complexity of multiprocessor and shop scheduling
zbMATH Open document ID: 1151.90433
author: Evgeny V. Shchepin
author: Nodari Vakhania
published in: Annals of Operations Research
publication date: 2008-09-03T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5320611
zbMATH Keywords: algorithm
zbMATH Keywords: shop scheduling
zbMATH Keywords: multiprocessor scheduling
zbMATH Keywords: time complexity
zbMATH Keywords: preemption
MaRDI profile type: Publication
full work available at URL: s10479-007-0266-1
OpenAlex ID: W1979626969
cites work: Open Shop Scheduling to Minimize Finish Time
cites work: Preemptive Scheduling of Uniform Processor Systems
cites work: Flowshop and Jobshop Schedules: Complexity and Approximation
cites work: The complexity of cyclic shop scheduling problems
cites work: An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem
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: Q4411417
cites work: Little-preemptive scheduling on unrelated processors
cites work: An optimal rounding gives a better approximation for scheduling unrelated machines
DOI: 10.1007/S10479-007-0266-1
description: scientific article; zbMATH DE number 5320611