On the complexity of scheduling problems for parallel/pipelined machines
From MaRDI portal
Publication:5375487
DOI10.1109/12.29469zbMath1395.90144OpenAlexW1994137996MaRDI QIDQ5375487
No author found.
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
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)
Related Items (4)
Analysis of scheduling problems with typed task systems ⋮ Scheduling with constrained processor allocation for interval orders ⋮ 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
This page was built for publication: On the complexity of scheduling problems for parallel/pipelined machines
