Time-optimal coordination of flexible manufacturing systems using deterministic finite automata and mixed integer linear programming (Q977004): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Cbc / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Supremica / rank
 
Normal rank
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.1007/s10626-009-0064-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2037118382 / 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: The job shop scheduling problem: Conventional and new solution techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compositional synthesis of maximally permissive supervisors using supervision equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-optimal coordination of flexible manufacturing systems using deterministic finite automata and mixed integer linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Control of vector discrete-event systems. II. Controller synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3372341 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global MILP model for FMS scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Taboo Search Algorithm for the Job Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4843187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992743 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996913 / rank
 
Normal rank

Latest revision as of 22:54, 2 July 2024

scientific article
Language Label Description Also known as
English
Time-optimal coordination of flexible manufacturing systems using deterministic finite automata and mixed integer linear programming
scientific article

    Statements

    Time-optimal coordination of flexible manufacturing systems using deterministic finite automata and mixed integer linear programming (English)
    0 references
    0 references
    0 references
    16 June 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    discrete event systems
    0 references
    scheduling
    0 references
    mixed integer linear programming
    0 references
    collision avoidance
    0 references
    deadlock avoidance
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references