---

＜電子ブック＞
Machine Scheduling to Minimize Weighted Completion Times : The Use of the α-point / by Nicoló Gusmeroli
(SpringerBriefs in Mathematics. ISSN:21918201)

版	1st ed. 2018.
出版者	(Cham : Springer International Publishing : Imprint: Springer)
出版年	2018
本文言語	英語
大きさ	XI, 53 p. 2 illus. in color : online resource
著者標目	*Gusmeroli, Nicoló author SpringerLink (Online service)
件　名	LCSH:Operations research LCSH:Management science LCSH:Mathematical optimization LCSH:Mathematics LCSH:Algorithms LCSH:Polytopes LCSH:Discrete mathematics FREE:Operations Research, Management Science FREE:Discrete Optimization FREE:Applications of Mathematics FREE:Algorithms FREE:Polytopes FREE:Discrete Mathematics
一般注記	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 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 HTTP:URL=https://doi.org/10.1007/978-3-319-77528-9

 類似資料