Machine Scheduling to Minimize Weighted Completion Times The Use of the α-point /
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 algorith...
Uloženo v:
| Hlavní autor: | |
|---|---|
| Médium: | Elektronický zdroj E-kniha |
| Jazyk: | angličtina |
| Vydáno: |
Cham :
Springer International Publishing,
2018.
|
| Vydání: | 1st ed. 2018. |
| Edice: | SpringerBriefs in Mathematics,
|
| Témata: | |
| ISBN: | 9783319775289 |
| ISSN: | 2191-8198 |
| On-line přístup: |
|
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
MARC
| LEADER | 00000nam a22000005i 4500 | ||
|---|---|---|---|
| 003 | SK-BrCVT | ||
| 005 | 20220618101254.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 180430s2018 gw | s |||| 0|eng d | ||
| 020 | |a 9783319775289 | ||
| 024 | 7 | |a 10.1007/978-3-319-77528-9 |2 doi | |
| 035 | |a CVTIDW11297 | ||
| 040 | |a Springer-Nature |b eng |c CVTISR |e AACR2 | ||
| 041 | |a eng | ||
| 100 | 1 | |a Gusmeroli, Nicoló. |4 aut | |
| 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. | ||
| 260 | 1 | |a Cham : |b Springer International Publishing, |c 2018. | |
| 300 | |a XI, 53 p. 2 illus. in color. |b online resource. | ||
| 490 | 1 | |a SpringerBriefs in Mathematics, |x 2191-8198 | |
| 500 | |a Mathematics and Statistics | ||
| 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. | |
| 516 | |a text file PDF | ||
| 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. | |
| 650 | 0 | |a Management science. | |
| 650 | 0 | |a Mathematical optimization. | |
| 650 | 0 | |a Applied mathematics. | |
| 650 | 0 | |a Engineering mathematics. | |
| 650 | 0 | |a Algorithms. | |
| 650 | 0 | |a Polytopes. | |
| 650 | 0 | |a Discrete mathematics. | |
| 856 | 4 | 0 | |u http://hanproxy.cvtisr.sk/han/cvti-ebook-springer-eisbn-978-3-319-77528-9 |y Vzdialený prístup pre registrovaných používateľov |
| 910 | |b ZE08577 | ||
| 919 | |a 978-3-319-77528-9 | ||
| 974 | |a andrea.lebedova |f Elektronické zdroje | ||
| 992 | |a SUD | ||
| 999 | |c 237004 |d 237004 | ||