Time-optimal coordination of flexible manufacturing systems using deterministic finite automata and mixed integer linear programming

DOI10.1007/s10626-009-0064-9zbMath1192.93075OpenAlexW2037118382MaRDI QIDQ977004

Martin Fabian, Avenir Kobetski

Publication date: 16 June 2010

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10626-009-0064-9

zbMATH Keywords

schedulingmixed integer linear programmingdeadlock avoidancecollision avoidancediscrete event systems

Mathematics Subject Classification ID

Mixed integer programming (90C11) Production models (90B30) Discrete event control/observation systems (93C65)

Related Items

Time-optimal control of large-scale systems of systems using compositional optimization ⋮ Time-optimal coordination of flexible manufacturing systems using deterministic finite automata and mixed integer linear programming ⋮ On the stabilization of nondeterministic finite automata via static output feedback

Uses Software

• CPLEX
• Cbc
• GLPK
• Supremica

Cites Work

• Time-optimal coordination of flexible manufacturing systems using deterministic finite automata and mixed integer linear programming
• The job shop scheduling problem: Conventional and new solution techniques
• A global MILP model for FMS scheduling
• Compositional synthesis of maximally permissive supervisors using supervision equivalence
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Control of vector discrete-event systems. II. Controller synthesis
• A Fast Taboo Search Algorithm for the Job Shop Problem
• Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems
• Depth-First Search and Linear Graph Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item