Proceedings, Volumes 1-2IEEE, 1999 - Artificial intelligence |
From inside the book
Results 1-3 of 81
Page 1086
... given for a given RTDES . Furthermore the state component of each augmented state X e X , remains in the state set X of G , since G and G have the same state transition structure . It follows naturally that each predicate , on the state ...
... given for a given RTDES . Furthermore the state component of each augmented state X e X , remains in the state set X of G , since G and G have the same state transition structure . It follows naturally that each predicate , on the state ...
Page 1348
... given . • The maximum and minimum number of com- pulsory working hours are given . The compul- sory working hours are the differences between the beginning and end of each shift . • The maximum and minimum of the sum of driving times ...
... given . • The maximum and minimum number of com- pulsory working hours are given . The compul- sory working hours are the differences between the beginning and end of each shift . • The maximum and minimum of the sum of driving times ...
Page 1357
... given set of dispatching rules for each machine : Z = { EDD , SLACK , SPT } . ( 9 ) Then the total of nine combinations of dispatching rules can be applied to the flow shop . For example , EDD is applied to the first machine , and SLACK ...
... given set of dispatching rules for each machine : Z = { EDD , SLACK , SPT } . ( 9 ) Then the total of nine combinations of dispatching rules can be applied to the flow shop . For example , EDD is applied to the first machine , and SLACK ...
Contents
Nonlinear Behavior of a Magnetic Microactuator 393 | 787 |
On Problem of Optimal Design of Transfer Lines with Parallel and Sequential | 790 |
Rigidity Analysis from Range Image Data for Automatic Inspection of Filter | 797 |
Copyright | |
76 other sections not shown
Other editions - View all
Common terms and phrases
analysis application approach architecture Automation behaviour cell communication components Computer configuration considered constraints control system Controller Area Network CORBA cycle cyclic data link layer database defined delay described detection developed devices diagram dispatching rules distributed dynamic elements environment equation evaluation example execution expert systems fieldbus Figure fitness function FPGA frame function blocks genetic algorithms grafcet IEEE implementation industrial input integration interface layer machine master agent maximum method microcontroller Modbus Modelica module nodes object obtained operation optimal output P-NET parameters path performance Petri nets problem product lifecycle management production Profibus protocol real-time represents request robot scheduling sensors sequence server simulation SNMP solution specification station structure sub agent subnetworks Table task techniques token transition transmission variables WorldFIP