Study of a NP-hard cyclic scheduling problem: The recurrent job-shop (Q1319564): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-2217(94)90332-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2042541831 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Un domaine très ouvert : les problèmes d'ordonnancement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3820002 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Solving the Job-Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3932272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3358512 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic Schedules for Job Shops with Identical Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mathematical Model for Periodic Scheduling Problems / rank
 
Normal rank

Latest revision as of 14:38, 22 May 2024

scientific article
Language Label Description Also known as
English
Study of a NP-hard cyclic scheduling problem: The recurrent job-shop
scientific article

    Statements

    Study of a NP-hard cyclic scheduling problem: The recurrent job-shop (English)
    0 references
    0 references
    12 April 1994
    0 references
    pipelined architectures
    0 references
    cyclic scheduling
    0 references
    disjunctive resources
    0 references
    recurrent job-shop
    0 references
    NP-hard
    0 references
    mixed linear program
    0 references
    branch-and-bound
    0 references
    heuristics
    0 references

    Identifiers