國立虎尾科技大學 |

Machine Scheduling to Minimize Weighted Completion Times = The Use of the α-point /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Machine Scheduling to Minimize Weighted Completion Times/ by Nicoló Gusmeroli.
其他題名:	The Use of the α-point /
作者:	Gusmeroli, Nicoló.
面頁冊數:	XI, 53 p. 2 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Operations research. -
電子資源:	https://doi.org/10.1007/978-3-319-77528-9
ISBN:	9783319775289

Machine Scheduling to Minimize Weighted Completion Times = The Use of the α-point /
Gusmeroli, Nicoló.

Machine Scheduling to Minimize Weighted Completion TimesThe Use of the α-point /[electronic resource] :by Nicoló Gusmeroli. - 1st ed. 2018. - XI, 53 p. 2 illus. in color.online resource. - SpringerBriefs in Mathematics,2191-8198. - SpringerBriefs in 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.

ISBN: 9783319775289

Standard No.: 10.1007/978-3-319-77528-9doiSubjects--Topical Terms:

573517
Operations research.

LC Class. No.: QA402-402.37

Dewey Class. No.: 519.6

Machine Scheduling to Minimize Weighted Completion Times = The Use of the α-point /
LDR:02584nam a22004215i 4500 001 993035
003 DE-He213
005 20200703101829.0
007 cr nn 008mamaa
008 201225s2018 gw | s |||| 0|eng d
020 $a 9783319775289 $9 978-3-319-77528-9
024 7 $a 10.1007/978-3-319-77528-9 $2 doi
035 $a 978-3-319-77528-9
050 4 $a QA402-402.37
050 4 $a T57.6-57.97
072 7 $a KJT $2 bicssc
072 7 $a BUS049000 $2 bisacsh
072 7 $a KJT $2 thema
072 7 $a KJM $2 thema
082 0 4 $a 519.6 $2 23
100 1 $a Gusmeroli, Nicoló. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1284572
245 1 0 $a Machine Scheduling to Minimize Weighted Completion Times $h [electronic resource] : $b The Use of the α-point / $c by Nicoló Gusmeroli.
250 $a 1st ed. 2018.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a XI, 53 p. 2 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a SpringerBriefs in Mathematics, $x 2191-8198
505 0 $a 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.
520 $a 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.
650 0 $a Operations research. $3 573517
650 0 $a Management science. $3 719678
650 0 $a Mathematical optimization. $3 527675
650 0 $a Applied mathematics. $3 1069907
650 0 $a Engineering mathematics. $3 562757
650 0 $a Algorithms. $3 527865
650 0 $a Polytopes. $3 884204
650 0 $a Discrete mathematics. $3 1254302
650 1 4 $a Operations Research, Management Science. $3 785065
650 2 4 $a Discrete Optimization. $3 1019327
650 2 4 $a Applications of Mathematics. $3 669175
650 2 4 $a Discrete Mathematics. $3 796600
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319775272
776 0 8 $i Printed edition: $z 9783319775296
830 0 $a SpringerBriefs in Mathematics, $x 2191-8198 $3 1255329
856 4 0 $u https://doi.org/10.1007/978-3-319-77528-9
912 $a ZDB-2-SMA
912 $a ZDB-2-SXMS
950 $a Mathematics and Statistics (SpringerNature-11649)
950 $a Mathematics and Statistics (R0) (SpringerNature-43713)