On a Choice of Successive Machine Loading
On a Choice of Successive Machine Loading
References
Additional sources and materials
1. S. D zh o n s o n. Optimal'noe raspisaine dlya dvukh- i trekhstupenchatykh protsessov s uchetom vremeni naladki. Kiberneticheskij sbornik. Novaya seriya, vyp. 1. M., «Mir», 1965.
2. Dzh. L i t l, K. M u r t i, D. S u i n i, K. K eh r e l. Algoritm dlya resheniya zadachio kommivoyazhere. Ehkonomika i matem. metody, 1965. t. 1, vyp. 1.
3. E. L. Lawler, D. E. Wood. Branch-and-boimd methods: a survey. Operat. Res., 1966, V. 14, № 4.
4. B. B. Sh k u p 6 a i dr. Zadachi kalendarnogo planirovaniya i metody ikh resheniya.Kiev, «Naukova dumka», 1966.
5. E. I g n a l l, L. S c h r a g e. Application of the branch- and bound-lechnicfue to some flow-schop scheduling problems. Operat. Res., 1965, v. 13, № 3.
6. Z. A. L o m n i c k i. A branch-and-bound algorithm for the exact solution of the three-machine scheduling problem. Operat. Res. Quart., 1965, v. 16, № 1.
7. A. P. G. B r o w n, Z. A. L o m n i c k i. Some applications of the branch-and bound algorithm to the machine scheduling problem. Operat. Res. Quart., 1966, v. 17, № 2.
8. S. E. K a m e n i ts e r, V. G. K o n t o r o v i ch, G. A. P i sch u l i n. Organizatsiya i planirovanie promyshlennykh predpriyatij. M., Politizdat, 1967.
Comments
No posts found