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

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2018.02.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2793045913 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On single-machine scheduling without intermediate delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with no idle time and release dates to~minimize a regular criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homogeneously non-idling schedules of unit-time jobs on identical parallel machines / rank
 
Normal rank

Revision as of 16:15, 15 July 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

    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
    24 May 2018
    0 references
    parallel-machine scheduling
    0 references
    directed graph
    0 references
    algorithmic complexity
    0 references

    Identifiers