Analysis of scheduling problems with typed task systems

DOI10.1016/0166-218X(94)90142-2zbMath0822.90083OpenAlexW1990630852WikidataQ126839747 ScholiaQ126839747MaRDI QIDQ1331888

Klaus Jansen

Publication date: 27 September 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(94)90142-2

zbMATH Keywords

NP-completetyped task systems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 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 (5)

Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times ⋮ Approximations for the two-machine cross-docking flow shop problem ⋮ Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan ⋮ Scheduling unit length jobs with parallel nested machine processing set restrictions ⋮ Review of properties of different precedence graphs for scheduling problems

Cites Work

• UET-scheduling with constrained processor allocations
• NP-complete scheduling problems
• Scheduling Interval-Ordered Tasks
• Complexity of Scheduling under Precedence Constraints
• On the complexity of scheduling problems for parallel/pipelined machines
• Unnamed Item
• Unnamed Item

This page was built for publication: Analysis of scheduling problems with typed task systems