| 000 | 01097nam a2200217uu 4500 | ||
|---|---|---|---|
| 001 | 3637 | ||
| 003 | OSt | ||
| 005 | 20190211154102.0 | ||
| 008 | 001114s1976 xx ||||g| |0|| 0 eng d | ||
| 020 | _a04711663198 | ||
| 090 |
_a2.05 _bC7383c |
||
| 245 | 1 | 0 | _aComputer and job-shop scheduling theory |
| 260 |
_aNew York : _bJohn Wiley & Sons, _c1976 |
||
| 300 | _a299 p. | ||
| 505 | 8 | 0 |
_t- Chapter one - Introduction to deterministic scheduling theory - E. G. Coffman, Jr. _t- Chapter two - Algorithms for minimal-length schedules - Ravi Sethi _t- Chapter three - scheduling algorithms for minimizing the mean weighted flow-time criterion - J. L. Bruno _t- Chapter four - Complexity of sequencing problems J. D. Ullman _t- Chapter five - Bounds on the performance of scheduling algorithms - R. L. Graham _t- Chapter six - Enumerative and iterative computational approaches - W. H. Kohler and K. Steiglitz |
| 650 | 4 |
_aGestão de Pessoas _912017 |
|
| 942 | _cG | ||
| 998 |
_a20001114 _bPieran _cPierangele |
||
| 998 |
_a20160330 _b1431^b _cDaiane |
||
| 999 |
_aConvertido do Formato PHL _bPHL2MARC21 1.1 _c3815 _d3815 |
||
| 700 | _a | ||
| 041 | _aeng | ||