Optimisation of invariant criteria for event graphs

DOI10.1109/9.135488zbMath0763.90053OpenAlexW2057816490MaRDI QIDQ4004772

Xiaolan Xie, Saïd Laftit, Jean Marie Proth

Publication date: 27 September 1992

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/9.135488

zbMATH Keywords

heuristiccycle timeKanban systemsevaluation of job shopsstrongly connected event graph

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (12)

SOLVING LINEAR INTEGER PROGRAMMING PROBLEMS BY A NOVEL NEURAL MODEL ⋮ Networked conflicting timed event graphs representation in (Max,+) algebra ⋮ Asymptotic properties of stochastic timed event graphs ⋮ Petri nets for the design and operation of manufacturing systems ⋮ Complexity results for weighted timed event graphs ⋮ A resource allocation problem on timed marked graphs: a decomposition approach ⋮ Cyclic scheduling for F.M.S.: Modelling and evolutionary solving approach ⋮ Firing rate optimization of cyclic timed event graphs by token allocations ⋮ A sufficient condition for the liveness of weighted event graphs ⋮ Minimizing place capacities of weighted event graphs for enforcing liveness ⋮ Marking optimization of stochastic timed event graphs using IPA ⋮ Some optimization problems for timed marked graphs

This page was built for publication: Optimisation of invariant criteria for event graphs