Index

-3-

3-PARTITION 20, 74, 109,327

-A-Active schedule 291 Absolute

error 36,64 performance ratio 35, 150

Acceptable schedule 438, 437 ACE loop 440,439,464 Activity network 59, 157, 168,350

uniconnected 59, 158 Acyclic graph 21 Additional resource 57, 66 Additive optimality criterion 32 Adjacency matrix 21 Adjacent pairwise interchange

property 84 Aggregation heuristic 264 Agreeable weights 107, 110 AGV routing 389 AI 443,441 Akers method 254 Algebraic equation 349 Algorithm 13

absolute error 64 performance ratio 35, 150

answer 14 approximation 35,63, 142, 154,

191,354 asymptotic performance ratio 35,

270 asymptotically optimal 36 backscheduling 78 backward scheduling 87 branch and bound 33, 74, 86, 88,

97,103,129,357,375,379

Coffman and Graham 153 critical path 151 critical ratio 388 Dinic 26 dynamic programming 32, 106,

109,120,131,143,324,354, 396

earliest completion time (ECT) 85 deadline 73, 80 due date (EDD) 96, 388 start time (EST) 85

efficient optimization 62 ETF 234 exact 16

enumerative 64 exponential time 16 first come first served (FCFS)

466 first fit decreasing (FFO) 327 first fit (FF) 327 GareyandJohnson 176,321 genetic 38, 40, 48 Giffler and Thompson 286, 290 Gilmore-Gomory 374 Gonzalez-Sahni 269 head 13 heuristic 16,35,37,98 Hodgson 105, 107 Horvath, Lam and Sethi 162 Hu 151 input 14 instance 14 iterated lowest fit decreasing

(ILFD) 327 Jackson 96 Johnson 251,252,374 Karmarkar 344 Kbachiyan 167 largest processing time (LPT)

140,141,375

474

Lawler 125, 356 level 151, 154 linear

integer programming 324 programming 157, 164, 168,

182,217,270,329,344 list scheduling 64, 150, 160,270,

373 longest processing time (LPT)

190,445 mathematical programming 345 McNaughton 146, 183, 189,328,

353,465 mean performance 36, 64 merge 14,15 method 14 minimum slack time (MST) 102 modified

due date (MDD) 388 task due date (MDT) 382

msort 15 nonperiodic 373 optimization 16 output 14 periodic 373 polynomial time 16, 183 preemptive 164 pseudopolynomial 19, 106, 110

optimization 64, 143 time 396

relative error 64 scheduling 62 Schrage 82 shortest processing time (SPT)

83,169,270,388,466 Sidney's decomposition 91 sort 15 suboptimal 16, 35 weighted shortest processing time

(WSPT) 84, 87 Allocation

resource 347 Almost sure convergence 36, 142 Alphabet 12 Analysis

object-oriented 429

INDEX

worst case 35 Anomalies

list scheduling 147 Answer 11, 14 Antichain 22 Antisymmetric relation 10 Approximate

approach 164, 183 solution 16

Approximation algorithm 35,63, 142, 154, 191,

354 scheme 107

Architecture 423, 467 Arrival time 58 Artificial intelligence 443,441 Aspiration level 44 Asymptotic performance ratio 35,

270 Asymptotically optimal 36 Augmenting path 26, 29 Automated

guided vehicle routing 389 storage area 389

Available task 59

-B-

Backscheduling 78 Backtracking 34 Backward scheduling rule 87 Balancing heuristic 461 Basic cuts 288 Binary constraint satisfaction

problem 307 Block 287 Beam search method 461 Bellman's principle 32 Benes network 208 Bi-criterion problem 359 Bijective function 10 Bill_oCmaterials 430 Binary

relation 9 search 175,216

Bipartite graph 22 Blackboard approach 461 Body of a task 97 Bottleneck

problem 372 processor 97

Bound lower 191 upper 191

Bound (in a branch and bound) upper 34

Bounding procedure 375

Bounding procedure 33 Branch

and bound 33, 74, 86, 88, 97, 103,129,357,375,379

fathomed 33 Branching 33

node 377 procedure 377 tree 33

Buffer 58, 373

-c-CAD 424 CAE 424,466 CAM 424,466 CAP 424 Capacity

edge 25 of a cut 25, 26 processing 184

Capacity constraints 118 CAQ 424,466 Cardinality 9 Cartesian product 9 Categories of resources 319 Conjunctive critical arc 278 Constraint propagation based

genetic algorithm 307 Chain 22,58, 154, 170 Change-over 465 Change-over cost 114

INDEX 475

Chronological hierarchy 440, 438 ClM 424,466 Circuit switching 209 Class

FP 18 NP 18 of search problems 18 P 18

Classification scheme 68 Closed

interval 9 queuing network 369

Closure transitive 10

Coarse grain parallelism 228 Coarse grained instance 231 Coffman and Graham algorithm

153 Combinatorial

optimization 62, 438, 437 search problem 11

Communication coprocessor 209 network 424

Completion time 60, 346 Complexity 16

function 13 Composite

interval 189 processor 185, 189

Computation model of 16

Computational complexity 16

Computational experiments 37 Computer

aided design 424 engineering 424 manufacturing 424 process planning 424 quality control 424

architecture 428 integrated manufacturing 424,

466

476

model realistic 16

Conflict detection 444

Conflict resolution 444, 442, 464 Connected

graph 21 vertices 21

Consistency checking 445,443 Constant delay scheduling 230 Constrained

resource project scheduling 354 weighted completion time 90

Constraint based scheduling 443,441 guided search 460 precedence 59,67 propagation 307,445,443 satisfaction problem 444, 442

Constraints hard 443,441 soft 443,441

Constructive model 438, 437

Contention 233 Continuous resource 319,344,346 Convergence

almost sure 36 in expectation 36 in probability 36 rate of 36

Convex combination 348 function 351 hull 348 programming problem 351

Cooling schedule 41 CORTES 460 Cost

change-over 114 flow

minimum 329 function

overtime 190 minimum total flow 32

CRIT rule 388

INDEX

Criterion additive optimality 32 aspiration level 44 dominance 256 due date 67,96, 174 earliness-tardiness 96 elimination 34 makespan 183 maximum lateness 67, 96 mean

earliness 114 flow time 67 weighted tardiness 96, 110 weighted information loss 191

minimizing change-over cost 114 maximum cost 123 mean

cost 128 flow time 169

schedule length 73, 139 minimum

mean weighted flow time 83 total overtime cost 190

optimality 60, 67 total late work 191 weighted number of tardy tasks

96,105,106 Critical

arc 278 path 278

algorithm 151 ratio rule 388 task 165 time 80

Crossover 48 CSP 444,442 Cube connected cycles network 208 Current density 346 Cut 25

of minimum capacity 26 CWCT problem 90 Cycle 21

directed 21 undirected 21

-D-Dannenbring heuristic 260 Database

management system 427 support 424

DBMS 427 Deadline 73, 190 Decision

problem 11, 17,444,442 process

multistage 32 support system 423 table 456

deterministic 457 Decomposition

algorithm 91 tree 23

Dedicated machines 66 processors 57, 66, 359

Dedicated processors 208,210 Degree

in- 21 out- 21

Delay scheduling 230 Delivery time 81,97,391 Delta network 208 Density

current 346 Dependenttasks 59,147,155,164,

168,169,175,350 Depth first

search 29, 34 strategy 379

Descriptive knowledge 458 models 438, 437

Desirability relative 107

Desirable precedence constraints 444,442

Determinacy problem 67 Deterministic

decision table 457

INDEX

scheduling problem 62, 65 Turing machine 18

Digraph 21 acyclic 21 isomorphic 21 series-parallel 23 task-on-arc 350

Dinic 26,31 Directed

cycle 21 graph 21 path 21

Disconnected graph 21 Discrete

resource 319,345

477

simulation 438, 437 Discrete-continuous resource 347 Discretely-divisible resource 345 Disjoint sum 23 Disjunctive

arc pair 276 critical arc 278 edge 276 graph 276, 307

Dispatch_order 430 Divisible task 208 Domain 9,10

knowledge 443,441 Dominance criterion 256 Doubly constrained resource 319 DSS 423 DTM 18 Due date 58, 444, 442

involving criterion 67,96, 174 modified 175

Dynamic job shop 371,381 problem 388 programming 32, 106, 109, 120,

131,143,324,354,396 multistage decision process 32

478

-E-

Earliest completion time rule (ECT) 85 deadline rule 73, 80 due date 174

rule 388 earliest task first rule 234 start time rule (EST) 85

Earliness-tardiness criterion 96 ECT rule 85 EDD

algorithm 388 order 105, 108 rule 96, 98, 99, 174

Edge 21 capacity 25 disjunctive 276

Efficient optimization 62 Ejection chain 38, 45 Elementary

instance 323 vector 323

Elimination criteria 34 ELS method 233 Encoding scheme 12

reasonable 13 Enrichment technique 444 Enumeration

implicit 32 Enumerative

approach 144 method 32, 120

Environment hard real time 67

Equivalence relation 10 Error

absolute 36, 64 relative 36, 64

EST rule 85 ETF algorithm 234 Exact

algorithm 16 enumerative algorithm 64

Excess 339

INDEX

Experiments computational 37

Expert system 458 Exponential time algorithm 16 Extended list scheduling 233

-F-

Facts 458 Fast insertion method 263 Fathomed branch 33 FCFS rule 466 Feasibility

problem 444, 442 test 174

Feasible permutation 94 resource set 344 schedule 120, 185, 189 solution 16

FF algorithm 327 FFD algorithm 327 FFS 372 Final vertex 21 Fine grain parallelism 228 First come first served rule (FCFS)

466 First fit

algorithm (FF) 327 decreasing algorithm (FFD) 327

Fixed production schedule 391 Fixture 389 Flexible

flow shop 372 job shop 371 manufacturing

cell 424,465 system 369,390

Flow 25 maximum 25,31 minimum

cost 329 total cost 32

shop 57,249,372

flexible 372 permutation 249 two-machine 359

time 60 total 25 value of 25

FMS 369 Forbidden region 78 Forest 151

in- 22 opposing 22, 152, 153 out- 22

FP class 18 Frontier search 34 Function 10

bijective 10 complexity 13 injective, one-one 10 order of 11 surjective, on to 10

Functional hierarchy 440, 438 Fuzzy

logic 456 rule 457 set 456 variables 457

-G-Gantt chart 60 Gap minimization heuristic 262 Garey and Johnson algorithm 176,

321 General

precedence constraint 90 purpose machine 369

Genetic algorithm 38, 40, 48 constraint propagation based 307 enumeration 49 local search 49

Guided local search 301 Giffler and Thompson algorithm

286,290 Gilmore-Gomory algorithm 374 Global scheduling procedure 388

INDEX

Gonzalez-Sahni algorithm 269 Grain 231 Granularity 231 Graph 21

acyclic 21 bipartite 22 connected 21 directed 21 disconnected 21 disjunctive 276 intersection 21 isomorphic 21 order 93 task-on-arc 59 undirected 21 union 21

Greedy linear extension 116 GSP rule 388

-H-

Half cuts 289 Half open interval 9 HAMILTONIAN CIRCUIT 19 Hard constraints 443,441 Hard real time environment 67 Head 283

of a task 97 of an algorithm 13

479

Heuristic 35,37,67,98, 160,353, 373,443,441 algorithm 16 balancing 461 Dannenbring 260 gap minimization 262 genetic local search 49 machine aggregation 264 Palmer 261 shifting bottleneck 281,291

Heuristics regret 413

Hierarchical solution 425 Hill-climbing 38 Hodgson's algorithm 105, 107 Horn's approach 174

480

Horvath, Lam and Sethi algorithm 162

Hu's algorithm 151 HYB rule 388 Hybrid rule 388 Hypercube 208 Hyperedge 22 Hypergraph 22

reduced 447

-1-

Identical parallel machines 390 processors 57, 139, 169, 174

ILFD algorithm 327 Immediate

predecessor 21 successor 21

Implicit enumeration 32 Imprecise computation 191 In-

degree 21 forest 22 process

inventory 118 time 67

tree 22,151,176 Incoming edge 25 Independenttasks 59,159,183,

347,352 Information loss 191 Ingot preheating process 360 Initial vertex 21 Injective function 10 Input 14

length 12 size 12

Instance 11, 14, 62 coarse-grained 231 elementary 323

INTEGER PROGRAMMING 19 linear 324

Intelligent production scheduling 424

INDEX

Interactive scheduling 443 Interchange

property 84 relation 84 string relation 94

Intersection graph 21 Interval

closed 9 composite 189 half open 9 of availability 189

open 9 order 10,22

Inverse relation 10 ipred 21 IPS 424,429,440,439,466 Irreflexive relation 10 ISIS 460 Isomorphic graphs 21 isucc 21 Iterated lowest fit decreasing

algorithm (ILFD) 327

-J-

Jackson's algorithm 96 Job shop 275 Job 58,430

based bound 377 module property 95, 130 release 423 shop 57

dynamic 381 problem 360, 436

traversing 423 type 118

Johnson algorithm 251, 252

Johnson's algorithm 374 j-optimal task set 107 Jump 115

number 115 optimal 115

Jumptracking 34 search strategy 97

-K-

Karmarkar's algorithm 344 k-ary

relation 9' k-consistent 307 k-restricted preemption 147 Khachiyan's algorithm 167 KNAPSACK 18, 20 Knapsack problem 11, 106 Knowledge

based approach 424 system 458

descriptive 458 procedural 458 representation 445,443

-L-

Labeling procedure 29 Lagrangian relaxation technique 92 Largest processing time rule (LPT)

140,141,375 Lateness 60

maximum 60 Lawler's algorithm 125, 356 Layered network 27 Learning algorithm 37 Level 155

algorithm 151, 154 Lexicographic

order 153 sum 23

Lexicographically smaller 10 Lifetime curve 346 Linear

array 208 extension 115, 116

greedy 116 integer programming 324 order 22

INDEX 481

programming 157, 164, 168, 182, 217,270,329,344

sum 23

Linked list 22 List scheduling 140, 270

algorithm 64, 150, 160,373 anomalies 147 extended 233

Load balancing and mapping 207 Local

memory 208 search 37,279,281,296

Logically conflicting preferences 445

Longest path 155 processing time rule (LPT) 190,

465 Lot scheduling 118

multi-product 118 Lower bound 33, 191 LPT

algorithm 140,141,375 mean performance 143 rate of convergence 142 relative error 142 rule 190, 465 simulation study 142 worst case behavior 141

-M-Machine 57,430

aggregation heuristic 264 based bound 376 dedicated 66 identical 465 scheduling 389 state 267

Main sets 157 Makespan 60,465

minimum 183 Manufacturing system 65,423 Master-flow network 208

482

Material 66 handling system 369

Mathematical programming 119, 345

Matrix adjacency 21

Maximum allowable tardiness 90 cost 123 flow 25,76 in-process time 67 lateness 60, 67, 96 value flow 31

McNaughton's rule 146, 183, 189, 328,353,465

MDDrule 388 Mean

earliness 114 flow time 60, 67, 169 in-process time 67 performance 36, 64

ofLPT 143 tardiness 60, 113, 383 weighted

flow time 60, 83 information loss 191 tardiness 60, 96, 110

Measure of acceptability 447 performance 60

merge 14, 15 Merging 11 Mesh 208 Meta-heuristics 37 Method 13, 14

enumerative 32 Minimizing

change-over cost 114 Cmax 190

Lmax 174 maximum cost 123 maximum lateness 96 mean

cost 128 flow time 169

INDEX

weighted flow time 83 schedule length 73, 139 total late work 191 weighted

number oftardy tasks 96, 105, 106

tardiness 96, 110 Minimum

cost flow 329 makespan 183 slack time rule (MST) 102 total

cost flow 32 overtime cost 190

min-max transportation problem 159

Mixed resource 347 Model

analysis 429 constructive 438, 437 descriptive 438, 437 object-oriented 429 of computation 16 reference 429

Modified due date 175 due date (MDD) 388 due date (MDT) 382 job due date rule (MDD) 388

Module of tasks 95 msort 15 MST rule 102 MTD algorithm 382 MTD rule 382, 388 Multi agent planning 460 MUL TIFIT 142 Multiobjective resource allocation

problem 354 Multiprocessor task 208, 330

scheduling 330 Multi-product lot scheduling 118 Multistage

decision process 32 interconnection network 208

Mutation 48

-N-NC-machine 369 NDTM 18 Neighborhood 39 Network 25

activity 59, 157, 168,350 communication 424 flow 166,174, 180 layered 27 queuing 438,441,437,439 transportation 159 uniconnected activity 59, 329

N-free precedence graph 23 Node 21

final 21 initial 21 predecessor 21 successor 21

Nondelay schedule 379 Nondeterministic Turing machine

18 Nonlinear programming problem

351 Nonperiodic algorithm 373 Nonpreemptable tasks 355 Nonpreemptive 321,326,351,352

schedule 59,60,169, 170 scheduling 147, 159, 174, 183,

190,353 Nonregular criterion 102 Nonrenewable resource 319 Normal schedule 77 Normalized

schedule 214,331 No-wait

constraint 267 flow shop 269 property 58 schedule 372

NP class 18 NP

complete 19,62

INDEX

hard 62 problem 19,35 unary 20

in the strong sense 20 strongly 20

N -structure 23 Number

of tardy tasks 61 problem 20

-0-

Offline planning 423, 438, 440

OFP 423,440,438,464 ONC 423,440,438,464

483

One state-variable machine problem 267

Oneblock procedure 124 One-one function 10 Online control 423,440,438 On-time set 108 OOA 429 Open

interval 9 shop 57

scheduling 269 Operations research 443, 441 OPIS 460 Opportunistic scheduling 295 Opposing forest 22, 152, 153 Optimal

asymptotically 36 schedule 62, 330 solution 11, 16,35

Optimality criterion 60, 67 additive 32 makespan 60 maximum

lateness 60 maximum cost 123 mean

flow time 60 tardiness 60 weighted

484

flow time 60 tardiness 60

number of tardy tasks 61 performance measure 60 schedule length 60 total resource utilization 358 weighted number of tardy tasks

61 Optimization

algorithm 16 combinatorial 438, 437 efficient 62 problem 11, 17 pseudopolynomial 64, 143

OR 443,441 Order

graph 93 interval 10, 22 lexicographic 153 of a function 11 partial 10

Ordered set partially 10

Ordering of nodes 351 Out-

degree 21 forest 22 tree 22, 151, 169, 176

Outgoing edge 25 Output 14 Overtime cost function 190

-p-

P class 18 Packet length coefficient 234 Pallet 389 Palmer heuristic 261 Parallel

processor 57,65,208 requirement 210 scheduling 139

Parallelism coarse grain 228 fine grain 228

INDEX

Parameter 11 Pareto

curve 359 optimal solution 358, 364

Part machine-preemption 370 preemption 370 scheduling 389

Partial order 10

Partially ordered set 10 PARTITION 139 Path 21

augmenting 26, 29 critical 151 directed 21 longest 155 shortest 27 undirected 21

Perfect shuffle network 208 Performance

measure 60 ratio

absolute 35, 150 asymptotic 35

worst case 264, 266 Periodic algorithm 373 Permutation 10

feasible 94 flow shop 249 schedule 250

Planning 430 offline 440, 438

P-node 24 Polymerization process 372 Polynomial

time algorithm 16, 183 transformation 18

Poset 10 Power set 9 Path consistent 307 Priority rule 291 PPS 424 Precedence

constraint 59,67, 125, 153 general constraint 90

graph 22 N-free 23 task-on-arc 157

in-tree 176 out-tree 176 relation 22, 443, 442 series-parallel 23,94

pred 21 Predecessor

immediate 21 vertex 21

Predictive level 424, 427, 460 production scheduling 423 scheduling 65

Preemption 59, 155, 161, 189,270 granularity 147 part 370 part-machine 370 task 350

Preemptive 100, 352 algorithm 164 processing 174 schedule 59,60,144,183 scheduling 164,171,180,214

Preferences logically conflicting 445 resource conflicting 445 time conflicting 445

Preprocessing 425 Prime module 95, 130 Principle of optimality 32 Priority 58

rule 279, 380, 382, 388, 443, 445, 441,443,460

Problem 3-PARTITION 74,109,327 combinatorial

optimization 62 search 11

constrained weighted completion time 90

constraint satisfaction 444, 442 convex programming 351 CWCT 90 decision 11, 17, 444, 442

INDEX 485

determinacy 67 deterministic scheduling 62 feasibility 444, 442 HAMILTONIAN CIRCUIT 19 instance 11 INTEGER PROGRAMMING 19 job shop 360 knapsack 11, 18, 106 linear

integer programming 324 programming 157

mathematical programming 119 maximum flow 25, 76 min-max transportation 159 multi objective resource allocation

354 nonlinear programming 351 NP-complete 62 NP-hard 19,35,62 number 20 optimization 11, 17 PARTITION 139 project scheduling 344 SATISFIABILITY 19 scheduling 57, 62, 63 tardiness 110 transportation 32, 172, 328 TRAVELING SALESMAN 19,

268 two-machine flow shop 359

Procedural knowledge 458 Procedure

labeling 29 oneblock 124

Process planning 424 Process_plan 430 Processing

capacity 161, 184 interval 183 speed 346

vs. resource amount model 346 speed factor 58 time 58,66

standard 58 vector of 58

486

vs. resource amount model 345,355

Processor 57 composite 185, 189 dedicated 57,66,359 feasible sets 157 identical 57, 139, 169, 174 parallel 57, 65 semi-identical 183 shared schedule 155 sharing 161 speed 57 uniform 57,65, 159, 170, 180,

183 unrelated 57, 158, 159, 164, 170,

180 Production

control 423 management 423 planning 423

system 424 schedule 391 scheduling 423

intelligent 424 predictive 423 reactive 423 shop floor 423 short term 424

Programming convex 351 dynamic 32, 106, 324, 396 linear 329, 344 mathematical 345 nonlinear 351 zero-one 92

Progress rate function 346 Project scheduling 344,354,371,

381 Property

no-wait 58 Pseudopolynomial

algorithm 19, 106, 110, 143 optimization algorithm 64 time algorithm 396

Purchasing_order 430

INDEX

-Q-

Queuing network 438, 437

closed 369

-R-

Range 9,10 Rate of convergence 36, 142 Ratio

asymptotic performance 270 rule 84 worst case performance 264

Reactive level 427 production scheduling 423 scheduling 65, 388, 424, 456,

460 Ready time 58,66,73, 190,356,

443,442 vs. resource amount model 360

Real time environment 67 hard 67

Realistic computer model 16 Reasonable encoding scheme 13 Reduced hypergraph 447 Reflexive relation 10 Regret heuristics 413 Regular performance criterion 101 Relation 9

anti symmetric 10 binary 9 equivalence 10 inverse 10 irreflexive 10 k-ary 9 precedence 443,442 reflexive 10 symmetric 10 transitive 10

Relative desirability 107 error 36,64

Relax and enrich strategy 443 Relaxation 63

technique 444 Release time 73,81

property 75 Renewable resource 319,345,346 Reproduction 48 Resource 57,66,319,430

additional 66 allocation 347 availability 443, 442 categories 319 conflicting preferences 445 constrained scheduling 319 constraints 319 continuous 319,344,346 discrete 319, 345 discrete-continuous 347 discretely-divisible 345 doubly constrained 319 feasible set 329,344 limit 320, 323 mixed 347 nonrenewable 319 project scheduling 354 renewable 319,345,346 request 58 requirement 320, 370 type 319,320,323

fixed number 323 utilization 358, 444, 442

REST 443 Ring 208 Rolling horizon 371,381,388 Rotational speed 346 Routing conditions 443, 442 Rule

backward scheduling 87 critical ratio 388 earliest

completion time (ECT) 85 deadline 73,80 due date (EOO) 96, 174, 388 start time (EST) 85

first come first served (FCFS) 466

INDEX 487

GSP 388 hybrid (RYB) 388 largest processing time (LPT)

140,141,190,375,465 McNaughton 146, 183, 189,328,

353,465 minimum slack time (MST) 102 modified

due date (MOD) 388 task due date (MDT) 382, 388

priority 443,445,441,443,460 shortest processing time (SPT)

83,169,270,388,466 Smith's

backward scheduling 87 ratio 84 weighted shortest processing

time (WSPT) 84, 87 UVW 121 weighted shortest processing time

(WSPT) 84

-s-SATISFIABILITY 19 Scatter search 50 Schedule 59,430

acceptable 438, 437 feasible 120, 183, 185, 189 length 60,67, 139,373,465 nondelay 379 nonpreemptive 59,60,169,170 normal 77 normalized 214,331 no-wait 372 optimal 62, 330 performance measure 60 preemptive 59,60, 144, 183 production 391 status 462 to meet deadlines 73 vehicle 393

Scheduling algorithm 62 anomalies 147

488

constraint based 443, 441 deterministic 65 dynanticjobshop 381 flexible job shop 372 in flexible manufacturing systems

369 interactive 443 list 140, 270 lot size 118 multiprocessor tasks 330 nonpreemptive 147,159,174,

183,190,353 open shop 269 parallel processor 139 predictive 65,460

production 423 preemptive 164, 171, 214 problem 57,62,63

deterministic 65 project 371,381 reactive 65, 388, 456, 460

production 423 release times and deadlines 74 release times and delivery times

81 setup 115 shop floor 423 short term 425

production 424 single

machine 73 processor 73

to meet deadlines 62 with continuous resources 344

Scheme encoding 12

Schrage's algorithm 82 Search

backtracking 34 beam 461 binary 175,216 constraint guided 460 depth first 29, 34, 379 frontier 34 local 37 problem 18

INDEX

strategy 34, 379 jumptracking 97

tree 33,76 Semi-identical processors 183 Series-parallel

digraph 23 precedence 94

Set 9 partially ordered 10

Set of machines 57 processors 57

Setup 115 optimal 115 scheduling 115 time 369, 373, 443, 442

Shifting bottleneck heuristic 291 Shop floor

information systems 439,437 production scheduling 423 scheduling 423

Short term production scheduling 424

Shortest path 27 processing time rule (SPT) 83,

169,270,388,466 Sidney's decomposition algorithm

91 Simple genetic algorithm 49 Simulated annealing 38, 40 Simulation 441, 439

discrete 438, 437 study 142

Simultaneous job and vehicle scheduling 396 scheduling and routing 390

Single machine scheduling 73 processor scheduling 73

Sink 25 Smith's

backward scheduling rule 87 ratio rule 84 weighted shortest processing time

rule (WSPT) 84, 87

SMS problem 73 S-node 23 Soft constraints 443, 441 Solution 11

approximate 16 feasible 16 optimal 11, 16 suboptimal 16 trial 33

SONIA 462 Sort 15 Source 25 Speed 57

factor 58 rotational 346

SPT rule 83, 169,270,388,466 Shifting bottleneck heuristic 281 Staff 430 Staircase pattern 171, 184 Standard processing time 58 Store-and-forward routing 209 Strategy

search 34 String 12

interchange relation 94 structured 12

Strongly NP-complete 20 Structured string 12 Subgraph 21 Suboptimal

algorithm 16, 35 solution 16

succ 21 Successor

immediate 21 vertex 21

Sum disjoint 23 lexicographic 23 linear 23

Surjective function 10 Symmetric relation 10 System

information 466 manufacturing 65 operation 427

INDEX

supervision 427

-T-Tabu

list 43 search 38, 40, 42

Tactical production plan 425 Tail 97,283 Tardiness 60

maximum allowable 90 mean 60

weighted 60 problem 110

Tardy set 108 task 61

number of 61 weighted number of 61

Task 430 available 59 dependent 59, 147, 155, 164,

168,169,175,350 duplication 228 grain 231

489

independent 59, 159, 183,347, 352

interchange relation 84 label 153 level 151, 155, 161 lot 115 nonpreemptable 355 on-arc graph 59, 157,350 on-node graph 59 preemption 59,270,350,465 priority 58 processing speed 346 state 346 weight 58

Threshold accepting 42 Time

arrival 58 completion 346 complexity 16, 188 conflicting preferences 445

490

delivery 391 ready 58,443,442 setup 369, 373,443,442

Tool 66, 389, 430 change 444,442 changing

device 369 system 369

magazine 369,389 storage area 369

Total flow 25 late work criterion 191 resource utilization 358

Transfer line 118 Transformation

polynomial 18 Transformed resource allocations

348 Transitive

closure 10 relation 10

Transport facilities 66 Transportation

network 159 problem 32, 159, 172, 328

TRA VEUNG SALESMAN 19 Traveling salesman problem 268 Tree

branching 33 decomposition 23 in- 22 network 208 out- 22 search 33, 76

Trial solution 33 Two-job cuts 289 Turing machine

deterministic 18 nondeterministic 18

Two-machine aggregation approach 164 flow shop problem 359

Two-phase method 164 Types of

jobs 118

INDEX

resources 319

-u-uan 59,158,168,329,351 Unary

NP-hard 20 Undirected

cycle 21 graph 21 path 21

Uniconnected activity network 59, 158,168,329

Uniform delay scheduling 228 processors 57,65, 159, 170, 180, 183

Union graph 21 Uniprocessor tasks 208 Unit

change-over cost 114 processing time 77, 86, 90, 96,

110, 118, 128 time interval 119 weight 87, 110

Unrelated processors 57, 158, 159, 164, 170, 180

Upper bound 34,191 Useful edge 28 UVW-rule 121

-v-Value of flow 25 Variable depth methods 45 Vector

elementary 323 of processing times 58

Vehicle routing with time window 392 schedule 393

Vertex 21 connected 21 final 21 initial 21

predecessor 21 successor 21

Virtual-cut-through 209

-w-Weight 58

agreeable 107, 110 Weighted

number oftardy tasks 61,96, 105, 106

shortest processing time rule (WSPT) 84

Work area 462 Work-in-process inventory 444,442 Wormhole routing 209 Worst case

analysis 35 behavior of LPT 141 bound 190 performance 264

ratio 266 WSPT rule 84, 87

-z-Zero-one programming 92

INDEX 491