Mixed graph colouring as scheduling multi-processor tasks with equal processing times
type: Item
instance of: scholarly article
title: Mixed graph colouring as scheduling multi-processor tasks with equal processing times
author: Yuriĭ Nazarovich Sotskov
published in: Zhurnal Belorusskogo Gosudarstvennogo Universiteta. Matematika. Informatika
publication date: 2025-01-22T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 7973360
zbMATH Keywords: optimisation
zbMATH Keywords: unit-time scheduling
zbMATH Keywords: makespan
zbMATH Keywords: mixed graph
zbMATH Keywords: vertex colouring
MaRDI profile type: Publication
cites work: Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs
cites work: Q4120593
cites work: Reducibility among Combinatorial Problems
cites work: Q2784175
cites work: Scheduling Problems and Mixed Graph Colorings
cites work: Using mixed graph coloring to minimize total completion time in job shop scheduling
cites work: Computational Complexity of Discrete Optimization Problems
cites work: Complexity of optimal scheduling problems with three jobs
cites work: The complexity of shop-scheduling problems with two or three jobs
cites work: NP-hardness of shop-scheduling problems with three jobs
cites work: Q4882997
cites work: Unit Execution Time Shop Problems
cites work: On the complexity of two machine job-shop scheduling with regular objective functions
cites work: Scheduling two jobs with fixed and nonfixed routes
cites work: Shop-scheduling problems with fixed and non-fixed machine orders of the jobs
cites work: Parameterized mixed graph coloring
cites work: Mixed graph colorings
cites work: Heuristics for generalized shop scheduling problems based on decomposition
cites work: Mixed multigraph approach to scheduling jobs on machines of different types∗
cites work: Restricted coloring models for timetabling
cites work: On a multiconstrained model for chromatic scheduling
cites work: Q5572939
cites work: Q4004084
cites work: Q4841579
cites work: Q4859840
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Q5657900
cites work: Shop scheduling problems with multiprocessor tasks on dedicated processors
cites work: Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems
cites work: Complexity of scheduling multiprocessor tasks with prespecified processors allocations
cites work: Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
description: scientific article; zbMATH DE number 7973360