Peter Brucker, "Scheduling Algorithms"
Pages: 371 | Publisher: Springer (2007-03-12) | ISBN: 354069515X | English | PDF | 1.7 MB
Pages: 371 | Publisher: Springer (2007-03-12) | ISBN: 354069515X | English | PDF | 1.7 MB
Besides scheduling problems for single and parallel machines and shop scheduling problems the book covers advanced models involving due-dates, sequence dependent changeover times and batching. Also multiprocessor task scheduling and problems with multi-purpose machines are discussed. The methods used to solve these problems are linear programming, dynamic programming, branch-and-bound algorithms, and local search heuristics. Complexity results for different classes of deterministic scheduling problems are summarized.
<div class="text-center"><a href="http://cutt.red/iemieJiw6eeJ?search=Scheduling%20Algorithms" rel="nofollow noopener" onclick="log_click('Scheduling%20Algorithms', 'cutt.red'); return true;" target="_blank" rel="nofollow noopener noreferrer">http://rapidshare.com/files/54717285/SA.rar</a></div>
Pass = www.avaxhome.ws