A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling (Q1382807): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On a scheduling problem in a robotized analytical system / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact optimal cyclic scheduling algorithm for multioperator service of a production line / rank
 
Normal rank
Property / cites work
 
Property / cites work: A network flow algorithm for just-in-time project scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3476584 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of multistage cyclic service of a production line by a transmanipulator / rank
 
Normal rank

Latest revision as of 11:38, 28 May 2024

scientific article
Language Label Description Also known as
English
A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling
scientific article

    Statements

    A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling (English)
    0 references
    0 references
    0 references
    18 March 1998
    0 references
    cyclic scheduling
    0 references
    identical jobs
    0 references
    re-entrant flowshop
    0 references
    strongly polynomial algorithm
    0 references

    Identifiers