Performance evaluation of job-shop systems using timed event-graphs

DOI10.1109/9.8644zbMath0656.90054OpenAlexW2016738003MaRDI QIDQ3804437

Hervé P. Hillion, Jean Marie Proth

Publication date: 1989

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

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

zbMATH Keywords

integer linear programmingheuristicbottleneck machinestimed Petri netsnear-optimal solutionsteady-state performancejob-shop systemscyclic production processTimed event-graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items (33)

SOLVING LINEAR INTEGER PROGRAMMING PROBLEMS BY A NOVEL NEURAL MODEL ⋮ A genetic approach to solving the problem of cyclic job shop scheduling with linear constraints ⋮ A study of the cyclic scheduling problem on parallel processors ⋮ Performance evaluation of marked graphs by linear programming ⋮ Towards robust predictive fault-tolerant control for a battery assembly system ⋮ Optimal synchronization of discrete event dynamic systems via timed marked graphs ⋮ Networked conflicting timed event graphs representation in (Max,+) algebra ⋮ Petri nets for the design and operation of manufacturing systems ⋮ Computational techniques for reachability analysis of Max-Plus-Linear systems ⋮ A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule ⋮ Diagnosing Hybrid Dynamical Systems Using Max-Plus Algebraic Methods ⋮ A resource allocation problem on timed marked graphs: a decomposition approach ⋮ Mathematical model for cyclic scheduling with work-in-process minimization ⋮ Computing the throughput of probabilistic and replicated streaming applications ⋮ Cyclic scheduling for F.M.S.: Modelling and evolutionary solving approach ⋮ Analytic evaluation of the cycle time on networked conflicting timed event graphs in the (Max,+) algebra ⋮ Stochastic modelling of flexible manufacturing systems ⋮ Firing rate optimization of cyclic timed event graphs by token allocations ⋮ Timed event graph-based cyclic reconfigurable flow shop modelling and optimization ⋮ Solving transient scheduling problems with constraint programming ⋮ A queue-based aggregation approach for performance evaluation of a production system with an AMHS ⋮ Periodic schedules for linear precedence constraints ⋮ A sufficient condition for the liveness of weighted event graphs ⋮ Minimizing place capacities of weighted event graphs for enforcing liveness ⋮ Modelling and analysis of wafer fabrication scheduling via generalized stochastic Petri net and simulated annealing ⋮ Marking optimization of stochastic timed event graphs using IPA ⋮ Petri net based scheduling ⋮ Petri net models of flexible and automated manufacturing systems: a survey ⋮ Some optimization problems for timed marked graphs ⋮ Analysis of discrete event systems by simulation of timed Petri net models ⋮ The basic cyclic scheduling problem with deadlines ⋮ Petri nets for modeling of dynamic systems -- a survey ⋮ Modelling and feedback control for a class of Petri Nets with shared resources subject to strict time constraints using Max-plus algebra

This page was built for publication: Performance evaluation of job-shop systems using timed event-graphs