A polynomial algorithm for the homogeneously non-idling scheduling problem of unit-time independent jobs on identical parallel machines (Q1752453): Difference between revisions

Latest revision as of 08:17, 11 December 2024

scientific article

Language	Label	Description	Also known as
English	A polynomial algorithm for the homogeneously non-idling scheduling problem of unit-time independent jobs on identical parallel machines	scientific article

Statements

instance of

scholarly article

0 references

title

A polynomial algorithm for the homogeneously non-idling scheduling problem of unit-time independent jobs on identical parallel machines (English)

0 references

0 references

0 references

Discrete Applied Mathematics

0 references

publication date

24 May 2018

0 references

zbMATH Keywords

parallel-machine scheduling

0 references

directed graph

0 references

algorithmic complexity

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.dam.2018.02.011

0 references

cites work

On single-machine scheduling without intermediate delays

0 references

Single-machine scheduling with no idle time and release dates to~minimize a regular criterion

0 references

Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times

0 references

Homogeneously non-idling schedules of unit-time jobs on identical parallel machines

0 references

Identifiers

zbMATH Open document ID

1457.90066

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

10.1016/J.DAM.2018.02.011

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1752453

@@ Property / DOI @@
-.1016/j.dam.2018.02.011
@@ Property / DOI: 10.1016/j.dam.2018.02.011 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2018.02.011
+Normal rank
@@ Property / OpenAlex ID @@
+W2793045913
@@ Property / OpenAlex ID: W2793045913 / rank @@
+Normal rank
@@ Property / cites work @@
+On single-machine scheduling without intermediate delays
+Normal rank
@@ Property / cites work @@
+Single-machine scheduling with no idle time and release dates to~minimize a regular criterion
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times
+Normal rank
@@ Property / cites work @@
+Homogeneously non-idling schedules of unit-time jobs on identical parallel machines
+Normal rank
@@ Property / Wikidata QID @@
+Q130069550
@@ Property / Wikidata QID: Q130069550 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2018.02.011
@@ Property / DOI: 10.1016/J.DAM.2018.02.011 / rank @@
+Normal rank