Modeling and Optimization of Traffic Flow in Urban Areas - Czech ...
Modeling and Optimization of Traffic Flow in Urban Areas - Czech ...
Modeling and Optimization of Traffic Flow in Urban Areas - Czech ...
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
4.3 Implemented Algorithm 47leg 1p=6leg 2p=6leg 3p=6leg 4p=6seatp=15backrestp=25, r=20assembly 1/2p=15assembly 2/2p=15Fig. 4.6: Graph representation <strong>of</strong> chair manufactur<strong>in</strong>gSolution <strong>of</strong> the schedul<strong>in</strong>g problem is shown <strong>in</strong> follow<strong>in</strong>g steps:1. Create desired tasks.>> T1 = task(’leg1’,6)Task "leg1"Process<strong>in</strong>g time: 6Release time: 0>> T2 = task(’leg2’,6);>> T3 = task(’leg3’,6);>> T4 = task(’leg4’,6);>> T5 = task(’seat’,6);>> T6 = task(’backrest’,25,20);>> T7 = task(’assembly1/2’,15);>> T8 = task(’assembly2/2’,15);2. Def<strong>in</strong>e precedence constra<strong>in</strong>ts by precedence matrix prec. Matrix hassize n × n where n is the number <strong>of</strong> tasks.>> prec = [0 0 0 0 0 1 0 0;...0 0 0 0 0 1 0 0;...0 0 0 0 0 1 0 0;...0 0 0 0 0 1 0 0;...0 0 0 0 0 1 0 0;...0 0 0 0 0 0 0 1;...0 0 0 0 0 0 0 1;...0 0 0 0 0 0 0 0];3. Create an object <strong>of</strong> taskset from recently def<strong>in</strong>ed objects.
Change language