No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths (Q2327957): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10951-018-0562-4 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of scheduling problems with no-wait in process / rank
 
Normal rank
Property / cites work
 
Property / cites work: On scheduling with the non-idling constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eulerian graphs and related topics. Part 1, Volume 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3673102 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hardness of compact scheduling in simplified open and flow shops. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The flow shop problem with no-idle constraints: a review and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Eulerian extensions and their application to no-wait flowshop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: On no-wait and no-idle flow shops with makespan criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Flow-Shop Sequencing Problem with No Wait in Process<sup>†</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Three-Machine No-Wait Flow Shop is NP-Complete / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129894466 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10951-018-0562-4 / rank
 
Normal rank

Latest revision as of 00:46, 18 December 2024

scientific article
Language Label Description Also known as
English
No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths
scientific article

    Statements

    No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 October 2019
    0 references
    no-idle/no-wait shop scheduling
    0 references
    dominoes
    0 references
    Eulerian path
    0 references
    Hamiltonian path
    0 references
    numerical matching with target sums
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references