MARC Record from marc_columbia

LEADER: 04068cam a2200361Ia 4500
001 6461619
005 20221122032906.0
008 070706t20072007nyua b 001 0 eng d
010 $a 2007926587
020 $a038771717X
020 $a9780387717173
029 1 $aOHX$bhar070045271
035 $a(OCoLC)ocn153576634
035 $a(OCoLC)153576634
035 $a(NNC)6461619
035 $a6461619
040 $aYDXCP$cYDXCP$dBTCTA$dBAKER$dOHX$dMTG$dEMU$dBWX$dOrLoB-B
050 4 $aTS157.5$b.J87 2007
082 04 $a658.53$222
245 00 $aJust-in-time scheduling :$bmodels and algorithms for computer and manufacturing systems /$cedited by Joanna Józefowska.
260 $aNew York :$bSpringer,$c[2007], ©2007.
300 $axiii, 255 pages :$billustrations ;$c25 cm.
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
490 1 $aInternational series in operations research & management science ;$v106
504 $aIncludes bibliographical references (p. [235]-251) and index.
505 00 $g1.$tJust-in-time concept in manufacturing and computer systems -- $g1.1.$tManufacturing systems -- $g1.1.1.$tProduction planning and control -- $g1.1.2.$tJust-in-time systems -- $g1.1.3.$tBalanced schedules -- $g1.1.4.$tEarliness and tardiness cost -- $g1.2.$tComputer systems -- $g1.2.1.$tReal-time systems -- $g1.2.2.$tHard real-time systems -- $g1.2.3.$tSoft real-time systems -- $g2.$tMethodological background -- $g2.1.$tDeterministic scheduling theory -- $g2.1.1.$tBasic definitions -- $g2.1.2.$tEarliness and tardiness cost functions -- $g2.1.3.$tScheduling algorithms and computational complexity -- $g2.2.$tThe Theory of Apportionment -- $g2.2.1.$tProblem formulation -- $g2.2.2.$tDivisor methods -- $g2.2.3.$tStaying within the quota -- $g2.2.4.$tImpossibility Theorem -- $g3.$tCommon due date -- $g3.1.$tLinear cost functions -- $g3.1.1.$tMean Absolute Deviation -- $g3.1.2.$tWeighted Sum of Absolute Deviations -- $g3.1.3.$tSymmetric weights -- $g3.1.4.$tTotal Weighted Earliness and Tardiness -- $g3.1.5.$tControllable due date -- $g3.1.6.$tControllable processing times -- $g3.1.7.$tResource dependent ready times -- $g3.1.8.$tCommon due window -- $g3.2.$tQuadratic cost function -- $g3.2.1.$tCompletion Time Variance -- $g3.2.2.$tRestricted MSD problem -- $g3.2.3.$tOther models -- $g4.$tIndividual due dates -- $g4.1.$tSchedules with idle time -- $g4.1.1.$tArbitrary weights -- $g4.1.2.$tProportional weights -- $g4.1.3.$tMean absolute lateness -- $g4.1.4.$tMaximizing the number of just-in-time tasks -- $g4.1.5.$tMinimizing the maximum earliness/tardiness cost -- $g4.1.6.$tScheduling with additional resources -- $g4.1.7.$tOther models -- $g4.2.$tSchedules without idle time -- $g4.2.1.$tArbitrary weights -- $g4.2.2.$tTask independent weights -- $g4.3.$tControllable due dates -- $g4.3.1.$tTWK due date model -- $g4.3.2.$tSLK due date model -- $g4.3.3.$tScheduling with batch setup times -- $g5.$tAlgorithms for schedule balancing -- $g5.1.$tThe multi-level scheduling problem -- $g5.1.1.$tProblem formulation -- $g5.1.2.$tMinimizing the maximum deviation -- $g5.1.3.$tMinimizing the total deviation -- $g5.2.$tThe single-level scheduling problem -- $g5.2.1.$tProblem formulation -- $g5.2.2.$tMinimizing the maximum deviation -- $g5.2.3.$tMinimizing the total deviation -- $g5.2.4.$tCyclic sequences -- $g5.2.5.$tTransformation of the PRV problem to the apportionment problem -- $g5.3.$tScheduling periodic tasks -- $g5.3.1.$tProblem formulation -- $g5.3.2.$tScheduling algorithms -- $g5.3.3.$tProperties of feasible schedules.
650 0 $aProduction scheduling$xMathematical models.
650 0 $aJust-in-time systems.$0http://id.loc.gov/authorities/subjects/sh88003148
650 0 $aBusiness logistics.$0http://id.loc.gov/authorities/subjects/sh85018306
700 1 $aJózefowska, Joanna.$0http://id.loc.gov/authorities/names/nb2006018422
830 0 $aInternational series in operations research & management science ;$v106.$0http://id.loc.gov/authorities/names/n95066827
852 00 $boff,bus$hTS157.5$i.J87 2007