An Optimal Solution for the Channel-Assignment Problem

DOI10.1109/TC.1979.1675260MaRDI QIDQ3856113zbMATH OpenOpenAlexFDO

Authors

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

zbMATH Keywords

channel-assignment problemjob schedulingLSI layout designpartitions of sets of intervals

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Cited in

(42)

• A solution method for a car fleet management problem with maintenance constraints
• Dominating sets and domatic number of circular arc graphs
• An introduction to parallelism in combinatorial optimization
• Minimizing channel density in standard cell layout
• 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
• Maximum \(k\)-covering of weighted transitive graphs with applications
• License class design: Complexity and algorithms
• A graph colouring model for assigning a heterogeneous workforce to a given schedule
• Routing trains through railway stations: Complexity issues
• 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
• An approximation algorithm for the license and shift class design problem
• Periodic assignment and graph colouring
• An analysis of shift class design problems
• Exact and approximation algorithms for the operational fixed interval scheduling problem
• A dynamic programming based algorithm for the crew scheduling problem.
• Distributionally robust fixed interval scheduling on parallel identical machines under uncertain finishing times
• Online interval scheduling with a bounded number of failures
• Jump number maximization for proper interval graphs and series-parallel graphs
• Interval scheduling with economies of scale
• Inverse interval scheduling via reduction on a single machine
• Stability and fairness in the job scheduling problem
• Models and algorithms for energy-efficient scheduling with immediate start of jobs
• Linear algorithms for chordal graphs of bounded directed vertex leafage
• Operational fixed job scheduling problem under spread time constraints: a branch-and-price algorithm
• Tactical fixed job scheduling with spread-time constraints
• Optimal interval scheduling with a resource constraint
• Improving fleet utilization for carriers by interval scheduling
• Algorithms for large scale shift minimisation personnel task scheduling problems
• Parallel computation on interval graphs: algorithms and experiments
• A CONSTANT TIME ALGORITHM FOR THE CHANNEL ASSIGNMENT PROBLEM USING THE RECONFIGURABLE MESH
• No-wait scheduling for locks
• Interval scheduling maximizing minimum coverage
• On the complexity of interval scheduling with a resource constraint
• Fixed interval scheduling with third‐party machines
• Mobility offer allocations in corporate settings
• On the computational complexity of (maximum) shift class scheduling
• The simultaneous interval number: a new width parameter that measures the similarity to interval graphs
• Dynamic algorithms for multimachine interval scheduling through analysis of idle intervals
• Fixed interval scheduling: models, applications, computational complexity and algorithms

This page was built for publication: An Optimal Solution for the Channel-Assignment Problem

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