UET-scheduling with constrained processor allocations

DOI10.1016/0305-0548(92)90054-9zbMath0751.90038OpenAlexW2075408660MaRDI QIDQ1185984

Hans Kellerer, Gerhard J. Woeginger

Publication date: 28 June 1992

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(92)90054-9

zbMATH Keywords

parallel machinespolynomial algorithmsprecedence constrained scheduling

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (7)

Analysis of scheduling problems with typed task systems ⋮ Scheduling with constrained processor allocation for interval orders ⋮ UET-scheduling with chain-type precedence constraints ⋮ A new approximation algorithm for UET-scheduling with chain-type precedence constraints. ⋮ Approximations for the two-machine cross-docking flow shop problem ⋮ Scheduling multiprocessor tasks -- An overview ⋮ Scheduling unit length jobs with parallel nested machine processing set restrictions

Cites Work

• Unnamed Item
• Unnamed Item
• On a scheduling problem where a job can be executed only by a limited number of processors
• Scheduling unit-time jobs on processors with different capabilities
• Nearly on-line scheduling of multiprocessor systems with memories
• Scheduling Interval-Ordered Tasks
• Erratum “Optimal Sequencing of Two Equivalent Processors”

This page was built for publication: UET-scheduling with constrained processor allocations