A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring (Q6047981): Difference between revisions

Revision as of 20:35, 2 August 2024

scientific article; zbMATH DE number 7737072

Language	Label	Description	Also known as
English	A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring	scientific article; zbMATH DE number 7737072

Statements

instance of

scholarly article

0 references

title

A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring (English)

0 references

author

Yuri N. Sotskov

0 references

published in

Automation and Remote Control

0 references

publication date

13 September 2023

0 references

zbMATH Keywords

schedule

0 references

preemption

0 references

makespan optimality

0 references

mixed graph

0 references

optimal coloring

0 references

MaRDI profile type

Publication

0 references

full work available at URL

https://doi.org/10.1134/s000511792302008x

0 references

cites work

Q4120593

0 references

Mixed graph colorings

0 references

Q2784175

0 references

Scheduling Problems and Mixed Graph Colorings

0 references

Using mixed graph coloring to minimize total completion time in job shop scheduling

0 references

0 references

0 references

0 references

0 references

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

0 references

Complexity of scheduling multiprocessor tasks with prespecified processors allocations

0 references

Shop scheduling problems with multiprocessor tasks on dedicated processors

0 references

Scheduling multiprocessor tasks -- An overview

0 references

A note on scheduling multiprocessor tasks with identical processing times.

0 references

Computational complexity of some scheduling problems with multiprocessor tasks

0 references

Scheduling multiprocessor UET tasks of two sizes

0 references

A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints

0 references

Identifiers

zbMATH Open document ID

1521.90073

0 references

DOI

10.1134/s000511792302008x

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6047981

@@ Property / cites work @@
+Q4120593
@@ Property / cites work: Q4120593 / rank @@
+Normal rank
@@ Property / cites work @@
+Mixed graph colorings
@@ Property / cites work: Mixed graph colorings / rank @@
+Normal rank
@@ Property / cites work @@
+Q2784175
@@ Property / cites work: Q2784175 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling Problems and Mixed Graph Colorings
@@ Property / cites work: Scheduling Problems and Mixed Graph Colorings / rank @@
+Normal rank
@@ Property / cites work @@
+Using mixed graph coloring to minimize total completion time in job shop scheduling
+Normal rank
@@ Property / cites work @@
+Q5572939
@@ Property / cites work: Q5572939 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4004084
@@ Property / cites work: Q4004084 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4841579
@@ Property / cites work: Q4841579 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4859840
@@ Property / cites work: Q4859840 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+Complexity of scheduling multiprocessor tasks with prespecified processors allocations
+Normal rank
@@ Property / cites work @@
+Shop scheduling problems with multiprocessor tasks on dedicated processors
+Normal rank
@@ Property / cites work @@
+Scheduling multiprocessor tasks -- An overview
@@ Property / cites work: Scheduling multiprocessor tasks -- An overview / rank @@
+Normal rank
@@ Property / cites work @@
+A note on scheduling multiprocessor tasks with identical processing times.
+Normal rank
@@ Property / cites work @@
+Computational complexity of some scheduling problems with multiprocessor tasks
+Normal rank
@@ Property / cites work @@
+Scheduling multiprocessor UET tasks of two sizes
@@ Property / cites work: Scheduling multiprocessor UET tasks of two sizes / rank @@
+Normal rank
@@ Property / cites work @@
+A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
+Normal rank