ENGLISH

Machine Scheduling to Minimize Weighted Completion Times

By Nicoló Gusmeroli

Book information

Publisher
Springer International Publishing
Year
2018
ISBN
978-3-319-77527-2, 978-3-319-77528-9
Language
english
Format
PDF
Filesize
858 kB (879027 bytes)
Series
SpringerBriefs in Mathematics
Edition
1st ed.
Pages
XI, 53\63
Time added
2018-08-15 07:07:45
Management Science; Discrete Optimization; ApplicaMathematics; Operations Research

Description

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. Front Matter ....Pages i-xi Machine Scheduling to Minimize Weighted Completion Times (Nicoló Gusmeroli)....Pages 1-50 Back Matter ....Pages 51-53

Similar books