Titlebook: Scheduling Algorithms; Peter Brucker Book 20044th edition Springer-Verlag Berlin Heidelberg 2004 Ablaufplanung.Algorithmen.Diskrete Optimi

愚蠢地活

书目名称Scheduling Algorithms影响因子(影响力)




书目名称Scheduling Algorithms影响因子(影响力)学科排名




书目名称Scheduling Algorithms网络公开度




书目名称Scheduling Algorithms网络公开度学科排名




书目名称Scheduling Algorithms被引频次




书目名称Scheduling Algorithms被引频次学科排名




书目名称Scheduling Algorithms年度引用




书目名称Scheduling Algorithms年度引用学科排名




书目名称Scheduling Algorithms读者反馈




书目名称Scheduling Algorithms读者反馈学科排名

nerve-sparing

allergy

Computational Complexity,ich computational problems are studied so that they can be classified as “easy” or “hard”. In this chapter we will describe the main points of such a theory. A more rigorous presentation can be found in the fundamental book of Carey & Johnson [92].

anachronistic

Single Machine Scheduling Problems,l present algorithms for single machine scheduling problems which are polynomial or pseudopolynomial. It is useful to note the following general result which holds for single machine problems: if all .. = 0 and if the objective function is a monotone function of the finishing times of the jobs, then

种属关系

febrile

Grating

lymphedema

文字

Default

Classification of Scheduling Problems,classification for the scheduling problems covered in the first part of this book will be given. This classification is based on a classification scheme widely used in the literature (see, e.g. Lawler et al. [138]). In later chapters we will extend this classification scheme.