Dynamic search tree decomposition for balancing assembly lines by parallel search

International Journal of Production Research

Volumn 41, Issue 7, 2003, Pages 1413-1430

  Sprecher, Arno ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ASSEMBLY; COMPUTER SIMULATION; OPTIMIZATION; PARALLEL ALGORITHMS; TREES (MATHEMATICS); VIRTUAL REALITY;

SEARCH TREES;

OPERATIONS RESEARCH;

EID: 0242301590     PISSN: 00207543     EISSN: None     Source Type: Journal    
DOI: 10.1080/0020754031000075853     Document Type: Article

References (27)

1. BARR, R. S. and HICKMAN, B. L., 1993, Reporting computational experiments with parallel algorithms: issues, measures and experts' opinions. ORSA Journal on Computing, 5, 2-18.
2. BAYBARS, I., 1986, A survey of exact algorithms for the simple assembly line balancing problem. Management Science, 32, 909-932.
3. BOURBEAU, B., CRAINIC, T. G. and GENDRON, B., 2000, Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem. Parallel Computing, 26, 27-46.
4. BRUCKER, P., DREXL, A., MÖHRING, R., NEUMANN, K. and PESCH, E., 1999, Resource-constrained project scheduling: notation, classification, model, and methods. European Journal of Operational Research, 112, 3-41.
5. DAVIS, E. W., 1975, Project network summary measures constrained-resource scheduling. AIIE Transactions, 5, 132-142.
6. GEIST, A., BEGUELIN, A., DONGARRA, J., JIANG, W., MANCHER, R. and SUNDERAM, V., 1994a, PVM: Parallel Virtual Machine - A User's Guide and Tutorial for Networked Parallel Computing (Cambridge, MA: MIT Press).
7. GEIST, A., BEGUELIN, A., DONGARRA, J., JIANG, W., MANCHER, R. and SUNDERAM, R., 1994b, PVM 3 user's guide and reference manual. Oak Ridge National Laboratory, Oak Ridge, TN.
8. GENDRON, B. and CRAINIC, T. G., 1994, Parallel branch-and-bound algorithms: survey and synthesis. Operations Research, 42, 1042-1066.
9. GRAMA, A. and KUMAR, V., 1995, Parallel search algorithms for discrete optimization problems. ORSA Journal on Computing, 1, 365-384.
10. GRAMA, A. and KUMAR, V., 1999, State of the art in parallel search techniques for parallel optimization. IEEE Transactions on Knowledge and Data Engineering, 11, 28-34.
11. HOFFMANN, T. R., 1992, EUREKA: a hybrid system for assembly line balancing. Management Science, 38, 39-47.
12. JOHNSON, R. V., 1988, Optimally balancing large assembly lines with 'FABLE'. Management Science, 34, 240-253.
13. KEYSER, T. K. and DAVIS, R. P., 1998, Distributed computing toward manufacturing scheduling problems. IIE Transactions, 30, 379-390.
14. KINDERVATER, G. A. P. and LENSTRA, J. K., 1988, Parallel computing in combinatorial optimization. Annals of Operations Research, 14, 245-289.
15. KOLISCH, R., SPRECHER, A. and DREXL, A., 1995, Characterization and generation of a general class of resource-constrained project scheduling problems. Management Science, 41, 1693-1703.
16. LAURSEN, P. S., 1993, Simple approaches to parallel branch and bound. Parallel Computing, 19, 143-152.
17. MANS, B., MAUTOR, T. and ROUCAIROL, C., 1995, A parallel depth first search branch and bound algorithm for the quadratic assignment problem. European Journal of Operational Research, 81, 617-628.
18. PATTERSON, J. H., SLOWINSKI, R., TALBOT, F. B. and WEGLARZ, J., 1989, An algorithm for a general class of precedence and resource constrained scheduling problems. In R. Slowinski and J. Weglarz (eds), Advances in Project Scheduling (Amsterdam: Elsevier), pp. 3-28.
19. ROUCAIROL, C., 1996, Parallel processing of difficult combinatorial optimization problems. European Journal of Operations Research, 92, 573-590.
20. SCHOLL, A., 1993, Data of assembly line balancing problems. Research Report, No. 16/93, Technische Hochschule Darmstadt, Germany.
21. SCHOLL, A., 1999, Balancing and Sequencing of Assembly Lines, second edition (Heidelberg: Physica-Verlag).
22. SCHOLL, A. and KLEIN, R., 1997, SALOME: a bidirectional branch and bound procedure for assembly line balancing. INFORMS Journal on Computing, 9, 319-334.
23. SCHRAGE, L. and BAKER, K. R., 1978, Dynamic programming of sequencing problems with precedence constraints. Operations Research, 26, 444-459.
24. SPRECHER, A., 1999, A competitive branch-and-bound algorithm for the simple assembly line balancing problem. International Journal of Production Research, 37, 1787-1816.
25. SPRECHER, A., 2000a, Scheduling resource-constrained projects competitively at modest memory requirements. Management Science, 46, 710-723.
26. SPRECHER, A., 2000b, SALBLIB: challenging instances for assembly line balancing. Manuskripte aus den Instituten für Betriebswirtschaftslehre, No, 526, University Kiel, Germany.
27. SPRECHER, A., 2002, Dynamic search tree decomposition for balancing assembly lines by parallel search: technical details and pseudo code. Manuskripte aus den Instituten für Betriebswirtschaftslehre, Universität Kiel, Germany.