000839011 000__ 02876cam\a2200541Ii\4500
000839011 001__ 839011
000839011 005__ 20230306144706.0
000839011 006__ m\\\\\o\\d\\\\\\\\
000839011 007__ cr\un\nnnunnun
000839011 008__ 180430s2018\\\\sz\a\\\\ob\\\\000\0\eng\d
000839011 020__ $$a9783319775289$$q(electronic book)
000839011 020__ $$a3319775286$$q(electronic book)
000839011 020__ $$z9783319775272
000839011 0247_ $$a10.1007/978-3-319-77528-9$$2doi
000839011 035__ $$aSP(OCoLC)on1034550340
000839011 035__ $$aSP(OCoLC)1034550340
000839011 040__ $$aAZU$$beng$$erda$$cAZU$$dGW5XE$$dN$T$$dGW5XE$$dYDX$$dUAB$$dOCLCF$$dOCLCQ
000839011 049__ $$aISEA
000839011 050_4 $$aT57.6$$b.G87 2018
000839011 08204 $$a658.4/034$$223
000839011 1001_ $$aGusmeroli, Nicoló,$$eauthor.
000839011 24510 $$aMachine scheduling to minimize weighted completion times :$$bthe use of the [alpha]-point /$$cNicoló Gusmeroli.
000839011 264_1 $$aCham, Switzerland :$$bSpringer,$$c[2018]
000839011 300__ $$a1 online resource (xi, 53 pages) :$$bcolor illustrations.
000839011 336__ $$atext$$btxt$$2rdacontent
000839011 337__ $$acomputer$$bc$$2rdamedia
000839011 338__ $$aonline resource$$bcr$$2rdacarrier
000839011 347__ $$atext file$$bPDF$$2rda
000839011 4901_ $$aSpringerBriefs in mathematics
000839011 504__ $$aIncludes bibliographical references.
000839011 5050_ $$a1 Introduction -- 2 List of Main Results -- 3 LP Relaxations for the Release Dates Case -- 4 Conversion Algorithm -- 5 Approximations for 1
000839011 506__ $$aAccess limited to authorized users.
000839011 520__ $$aThis 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.
000839011 588__ $$aDescription based on online resource; title from digital title page (viewed on May 15, 2018).
000839011 650_0 $$aOperations research.
000839011 650_0 $$aScheduling.
000839011 650_0 $$aMathematical optimization.
000839011 650_0 $$aEngineering mathematics.
000839011 650_0 $$aAlgorithms.
000839011 650_0 $$aPolytopes.
000839011 650_0 $$aManagement science.
000839011 650_0 $$aComputer science$$xMathematics.
000839011 77608 $$iPrint version:$$z9783319775272
000839011 830_0 $$aSpringerBriefs in mathematics.
000839011 852__ $$bebk
000839011 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-319-77528-9$$zOnline Access$$91397441.1
000839011 909CO $$ooai:library.usi.edu:839011$$pGLOBAL_SET
000839011 980__ $$aEBOOK
000839011 980__ $$aBIB
000839011 982__ $$aEbook
000839011 983__ $$aOnline
000839011 994__ $$a92$$bISE