An Optimal Solution for the Channel-Assignment Problem
From MaRDI portal
Publication:3856113
DOI10.1109/TC.1979.1675260zbMath0422.68031OpenAlexW1761548667MaRDI QIDQ3856113
No author found.
Publication date: 1979
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.1979.1675260
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Discrete mathematics in relation to computer science (68R99)
Related Items (41)
An introduction to parallelism in combinatorial optimization ⋮ An approximation algorithm for the license and shift class design problem ⋮ Periodic assignment and graph colouring ⋮ Parallel computation on interval graphs: algorithms and experiments ⋮ An analysis of shift class design problems ⋮ Minimizing channel density in standard cell layout ⋮ Tactical fixed job scheduling with spread-time constraints ⋮ Optimal interval scheduling with a resource constraint ⋮ Distributionally robust fixed interval scheduling on parallel identical machines under uncertain finishing times ⋮ A CONSTANT TIME ALGORITHM FOR THE CHANNEL ASSIGNMENT PROBLEM USING THE RECONFIGURABLE MESH ⋮ Fixed interval scheduling: models, applications, computational complexity and algorithms ⋮ Inverse interval scheduling via reduction on a single machine ⋮ Exact and approximation algorithms for the operational fixed interval scheduling problem ⋮ Fixed interval scheduling with third‐party machines ⋮ Mobility offer allocations in corporate settings ⋮ A dynamic programming based algorithm for the crew scheduling problem. ⋮ Improving fleet utilization for carriers by interval scheduling ⋮ Algorithms for large scale shift minimisation personnel task scheduling problems ⋮ Online interval scheduling with a bounded number of failures ⋮ No-Wait Scheduling for Locks ⋮ On the computational complexity of (maximum) class scheduling ⋮ An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model ⋮ A constant-time channel-assignment algorithm on reconfigurable meshes ⋮ On the computational complexity of (maximum) shift class scheduling ⋮ Interval scheduling maximizing minimum coverage ⋮ Maximum \(k\)-covering of weighted transitive graphs with applications ⋮ License class design: Complexity and algorithms ⋮ On the complexity of interval scheduling with a resource constraint ⋮ Stability and fairness in the job scheduling problem ⋮ Operational fixed job scheduling problem under spread time constraints: a branch-and-price algorithm ⋮ Dynamic algorithms for multimachine interval scheduling through analysis of idle intervals ⋮ A graph colouring model for assigning a heterogeneous workforce to a given schedule ⋮ Jump number maximization for proper interval graphs and series-parallel graphs ⋮ Routing trains through railway stations: Complexity issues ⋮ Models and algorithms for energy-efficient scheduling with immediate start of jobs ⋮ Linear Algorithms for Chordal Graphs of Bounded Directed Vertex Leafage ⋮ A solution method for a car fleet management problem with maintenance constraints ⋮ Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times ⋮ A simple optimal parallel algorithm for the minimum coloring problem on interval graphs ⋮ Interval scheduling with economies of scale ⋮ Dominating sets and domatic number of circular arc graphs
This page was built for publication: An Optimal Solution for the Channel-Assignment Problem
