Machine scheduling to minimize weighted completion times : the use of the α-point
著者
書誌事項
Machine scheduling to minimize weighted completion times : the use of the α-point
（SpringerBriefs in mathematics）
Springer, c2018
- : [pbk.]
大学図書館所蔵 件 / 全2件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Bibliography: p. 51-53
内容説明・目次
内容説明
This work reviews the most important results regarding the use of the -point in Scheduling Theory. It provides a number of different LP-relaxations for scheduling problems and seeks to explain their polyhedral consequences. It also explains the concept of the -point and how the conversion algorithm works, pointing out the relations to the sum of the weighted completion times. Lastly, the book explores the latest techniques used for many scheduling problems with different constraints, such as release dates, precedences, and parallel machines. This reference book is intended for advanced undergraduate and postgraduate students who are interested in scheduling theory. It is also inspiring for researchers wanting to learn about sophisticated techniques and open problems of the field.
目次
1 Introduction.- 2 List of Main Results.- 3 LP Relaxations for the Release Dates Case.- 4 Conversion Algorithm.- 5 Approximations for 1| rj | wjCj.- 6 Approximations for 1| rj | Cj.- 7 Approximation for 1| rj, prec | wj Cj.- 8 Approximation for P | r j | Cj.- 9 Approximation for P | dij | wj Cj.- 10 Conclusions.
「Nielsen BookData」 より