On the complexity of scheduling problems for parallel/pipelined machines

DOI10.1109/12.29469zbMATH Open1395.90144OpenAlexW1994137996MaRDI QIDQ5375487FDOQ5375487

Authors:

Publication date: 14 September 2018

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.29469

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)

Cited In (10)

• Complexity and inapproximability results for parallel task scheduling and strip packing
• A hybridization of mathematical programming and dominance-driven enumeration for solving shift-selection and task-sequencing problems
• Approximations for the two-machine cross-docking flow shop problem
• Approximation algorithms for scheduling arithmetic expressions on pipelined machines
• Scheduling with constrained processor allocation for interval orders
• Analysis of scheduling problems with typed task systems
• Scheduling of pipelined operator graphs
• Complexity of preemptive minsum scheduling on unrelated parallel machines
• Complexity of scheduling problems with multi-purpose machines
• A bound analysis of scheduling instructions on pipelined processors with a maximal delay of one cycle

This page was built for publication: On the complexity of scheduling problems for parallel/pipelined machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5375487)