| [1] |
Garey, M. R.; Graham, R. L.; Johnson, D. S.; Yao, C. C., Resource constrained scheduling as generalized bin packing, J. Combinatorial Theory Ser. A, 21, 257-298 (1976) · Zbl 0384.90053 |
| [2] |
Garey, M. R.; Johnson, D. S., Approximation algorithms for bin packing problems: A survey, (Ausiello, G.; Lucertini, M., Analysis and Design of Algorithms in Combinatorial Optimization (1981), Springer: Springer Vienna), 147-172 |
| [3] |
Gutjahr, A. L.; Nemhauser, G. L., An algorithm for the line balancing problem, Management Sci., 11, 2, 308-315 (1964) · Zbl 0137.39303 |
| [4] |
Jackson, J. R., A computing procedure for a line balancing problem, Management Sci., 13, 261-272 (1956) |
| [5] |
Johnson, D. S.; Damers, A.; Ullman, J. D.; Garey, M. R.; Graham, R. L., Worst-case performance bounds for simple one-dimensional packing algorithms, SIAM J. Comput., 3, 299-325 (1974) · Zbl 0297.68028 |
| [6] |
Magazine, M. J.; Wee, T. S., Fast algorithms for the assembly line balancing problem, University of Waterloo Paper (1981) · Zbl 0491.90049 |
| [7] |
Schrage, L.; Baker, K. R., Dynamic programming solution of sequencing problems with precedence constraints, Operations Res., 26, 444-449 (1978) · Zbl 0383.90054 |
| [8] |
Wee, T. S.; Magazine, M. J., An efficient branch and bound algorithm for assembly line balancing — Part 1: Minimize the number of work stations, University of Waterloo Working Paper (1981) |
| [9] |
Wee, T. S.; Magazine, M. J., An efficient branch and bound algorithm for assembly line balancing — Part 2: Maximize the production rate, University of Waterloo Working Paper (1981) |
| [10] |
Yao, A. C.C., New algorithms in bin packing, (Technical Report STAN-CS-78-662 (1978), Department of Computer Science, Stanford University) |
