000			03456nam a22005175i 4500
001			978-0-387-87719-8
003			DE-He213
005			20251006084427.0
007			cr nn 008mamaa
008			100301s2009 xxu| s |||| 0|eng d
020			_a9780387877198
020			_a99780387877198
024	7		_a10.1007/978-0-387-87719-8 _2doi
082	0	4	_a658.40301 _223
100	1		_aKubiak, Wieslaw. _eauthor.
245	1	0	_aProportional Optimization and Fairness _h[electronic resource] / _cby Wieslaw Kubiak.
264		1	_aBoston, MA : _bSpringer US, _c2009.
300			_bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aInternational Series in Operations Research & Management Science, _x0884-8289 ; _v127
505	0		_aPreliminaries -- The Theory of Apportionment and Just-In-Time Sequences -- Minimization of Just-In-Time Sequence Deviation -- Optimality of Cyclic Sequences and the Oneness -- Bottleneck Minimization -- Competition-Free Instances, The Fraenkel's Conjecture, and Optimal Admission Sequences -- Response Time Variability -- Applications to the Liu-Layland Problem and Pinwheel Scheduling -- Temporal Capacity Constraints and Supply Chain Balancing -- Fair Queueing and Stride Scheduling -- Smoothing and Batching.
520			_aProportional Optimization and Fairness is a long-needed attempt to reconcile optimization with apportionment in just-in-time (JIT) sequences and find the common ground in solving problems ranging from sequencing mixed-model just-in-time assembly lines through just-in-time batch production, balancing workloads in event graphs to bandwidth allocation internet gateways and resource allocation in computer operating systems. The book argues that apportionment theory and optimization based on deviation functions provide natural benchmarks for a process, and then looks at the recent research and developments in the field. Individual chapters look at the theory of apportionment and just-in-time sequences; minimization of just-in-time sequence deviation; optimality of cyclic sequences and the oneness; bottleneck minimization; competition-free instances, Fraenkel's Conjecture, and optimal admission sequences; response time variability; applications to the Liu-Layland Problem and pinwheel scheduling; temporal capacity constraints and supply chain balancing; fair queueing and stride scheduling; and smoothing and batching.
650		0	_aECONOMICS.
650		0	_aMATHEMATICAL OPTIMIZATION.
650		0	_aINDUSTRIAL ENGINEERING.
650		0	_aBUSINESS LOGISTICS.
650		0	_aTECHNOLOGY.
650	1	4	_aECONOMICS/MANAGEMENT SCIENCE.
650	2	4	_aOPERATIONS RESEARCH/DECISION THEORY.
650	2	4	_aINDUSTRIAL AND PRODUCTION ENGINEERING.
650	2	4	_aMATHEMATICAL MODELING AND INDUSTRIAL MATHEMATICS.
650	2	4	_aOPTIMIZATION.
650	2	4	_aPRODUCTION/LOGISTICS.
650	2	4	_aTECHNOLOGY MANAGEMENT.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9780387877181
830		0	_aInternational Series in Operations Research & Management Science, _x0884-8289 ; _v127
856	4	0	_uhttp://dx.doi.org/10.1007/978-0-387-87719-8 _zVer el texto completo en las instalaciones del CICY
912			_aZDB-2-SBE
942			_2ddc _cER
999			_c59339 _d59339