TY  - GEN
N2  - This work reviews the most important results regarding the use of the [alpha]-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 [alpha]-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.
DO  - 10.1007/978-3-319-77528-9
DO  - doi
AB  - This work reviews the most important results regarding the use of the [alpha]-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 [alpha]-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.
T1  - Machine scheduling to minimize weighted completion times :the use of the [alpha]-point /
AU  - Gusmeroli, Nicoló,
CN  - T57.6
ID  - 839011
KW  - Operations research.
KW  - Scheduling.
KW  - Mathematical optimization.
KW  - Engineering mathematics.
KW  - Algorithms.
KW  - Polytopes.
KW  - Management science.
KW  - Computer science
SN  - 9783319775289
SN  - 3319775286
TI  - Machine scheduling to minimize weighted completion times :the use of the [alpha]-point /
LK  - https://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-319-77528-9
UR  - https://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-319-77528-9
ER  -