Titlebook: Constraint-Based Scheduling; Applying Constraint Philippe Baptiste,Claude Pape,Wim Nuijten Book 2001 Springer Science+Business Media New Y

不友善

書目名稱Constraint-Based Scheduling影響因子(影響力)




書目名稱Constraint-Based Scheduling影響因子(影響力)學(xué)科排名




書目名稱Constraint-Based Scheduling網(wǎng)絡(luò)公開度




書目名稱Constraint-Based Scheduling網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Constraint-Based Scheduling被引頻次




書目名稱Constraint-Based Scheduling被引頻次學(xué)科排名




書目名稱Constraint-Based Scheduling年度引用




書目名稱Constraint-Based Scheduling年度引用學(xué)科排名




書目名稱Constraint-Based Scheduling讀者反饋




書目名稱Constraint-Based Scheduling讀者反饋學(xué)科排名

敲詐

Propagation of Cumulative Constraints,ivity ., the . variable is not meaningful and we use a variable . that represents the global “energy” required by the activity on the resource. Of course, for a non-elastic activity, we have . = .. In all case, enough resource must be allocated to activities, . = Σ., ., where ., . is the amount of r

BURSA

Propagation of Objective Functions,ndependently is not a problem when . is a “maximum” such as . or .. Indeed, the upper bound on . is directly propagated on the completion time of each activity, ., deadlines are efficiently tightened. The situation is much more complex for sum functions such as Σ., Σ. or Σ. For these functions, the

欲望

Resolution of Disjunctive Problems,e in disjunction). These problems have been widely studied in the literature. In this chapter we address three problems: (1) the Job-Shop Problem where operations of jobs have to be processed in a given order by some specified machines, (2) the Open-Shop Problem where operations of the same job cann

全能

Cumulative Scheduling Problems, of resources with given capacities, (.) a set of non-interruptible activities of given processing times, (.) a network of precedence constraints between the activities, and (.) for each activity and each resource the amount of the resource required by the activity over its execution, the goal of th

LEVER

LEVER

Propagation of Cumulative Constraints,ount of the capacity (resp. of the energy) of the resource required by .. Finally we note . the maximum value in the domain of the resource capacity. In this chapter, we recall the most well-known techniques used to propagate the cumulative resource constraint. We focus on the fully elastic case in

譏諷

Book 2001roblems. .. Chapters 2, 3, 4, and 5 are focused on thepropagation of resource constraints, which usually are responsible forthe "hardness" of the scheduling problem. .. Chapters 6, 7, and 8are dedicated to the resolution of several scheduling problems. Theseexamples illustrate the use and the practi

surmount

assent