Mixed graph colouring as scheduling multi-processor tasks with equal processing times
From MaRDI portal
Publication:6669643
Publication date: 22 January 2025
Published in: Zhurnal Belorusskogo Gosudarstvennogo Universiteta. Matematika. Informatika (Search for Journal in Brave)
Applications of graph theory (05C90) Deterministic scheduling theory in operations research (90B35) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reducibility among Combinatorial Problems
- Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Using mixed graph coloring to minimize total completion time in job shop scheduling
- Scheduling two jobs with fixed and nonfixed routes
- NP-hardness of shop-scheduling problems with three jobs
- Shop-scheduling problems with fixed and non-fixed machine orders of the jobs
- Computational Complexity of Discrete Optimization Problems
- Unit Execution Time Shop Problems
- The complexity of shop-scheduling problems with two or three jobs
- Restricted coloring models for timetabling
- Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
- Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs
- On a multiconstrained model for chromatic scheduling
- Mixed multigraph approach to scheduling jobs on machines of different types∗
- Mixed graph colorings
- Scheduling Problems and Mixed Graph Colorings
- Complexity of scheduling multiprocessor tasks with prespecified processors allocations
- Shop scheduling problems with multiprocessor tasks on dedicated processors
- Heuristics for generalized shop scheduling problems based on decomposition
- Parameterized mixed graph coloring
- On the complexity of two machine job-shop scheduling with regular objective functions
- Complexity of optimal scheduling problems with three jobs
This page was built for publication: Mixed graph colouring as scheduling multi-processor tasks with equal processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6669643)
