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?)
- Using mixed graph coloring to minimize total completion time in job shop scheduling
- The complexity of shop-scheduling problems with two or three jobs
- Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems
- Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
- On a multiconstrained model for chromatic scheduling
- Scheduling two jobs with fixed and nonfixed routes
- Complexity of scheduling multiprocessor tasks with prespecified processors allocations
- Restricted coloring models for timetabling
- Mixed graph colorings
- On the complexity of two machine job-shop scheduling with regular objective functions
- NP-hardness of shop-scheduling problems with three jobs
- Shop scheduling problems with multiprocessor tasks on dedicated processors
- Shop-scheduling problems with fixed and non-fixed machine orders of the jobs
- Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs
- Parameterized mixed graph coloring
- Scheduling Problems and Mixed Graph Colorings
- Unit Execution Time Shop Problems
- Complexity of optimal scheduling problems with three jobs
- Computational Complexity of Discrete Optimization Problems
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Heuristics for generalized shop scheduling problems based on decomposition
- Mixed multigraph approach to scheduling jobs on machines of different types∗
- Reducibility among Combinatorial Problems
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)
