Maximizing the production rate in simple assembly line balancing — A branch and bound procedure

Baybars, 1986, A survey of exact algorithms for the simple assembly line balancing problem, Management Science, 32, 909, 10.1287/mnsc.32.8.909

Charlton, 1969, A general method for machine scheduling, International Journal of Production Research, 7, 207, 10.1080/00207546808929811

Coffman, 1978, An application of bin-packing to multiprocessor scheduling, SIAM Journal on Computing, 7, 1, 10.1137/0207001

Domschke, 1993

Hackman, 1989, Fast, effective algorithms for simple assembly line balancing problems, Operations Research, 37, 916, 10.1287/opre.37.6.916

Held, 1963, Assembly line balancing — Dynamic programming with precedence constraints, Operations Research, 11, 442, 10.1287/opre.11.3.442

Hoffmann, 1963, Assembly line balancing with a precedence matrix, Management Science, 9, 551, 10.1287/mnsc.9.4.551

Hoffmann, 1992, EUREKA: A hybrid system for assembly line balancing, Management Science, 38, 39, 10.1287/mnsc.38.1.39

Jackson, 1956, A computing procedure for a line balancing problem, Management Science, 2, 261, 10.1287/mnsc.2.3.261

Johnson, 1988, Optimally balancing large assembly lines with ‘FABLE’, Management Science, 34, 240, 10.1287/mnsc.34.2.240

Lawler, 1991, Computing shortest paths in networks derived from recurrence relations, Annals of Operations Research, 33, 363, 10.1007/BF02073941

Mansoor, 1964, Assembly line balancing — An improvement on the ranked positional weight technique, Journal of Industrial Engineering, 15, 73

Mansoor, 1964, Assembly line balancing — An improvement on the ranked positional weight technique, Journal of Industrial Engineering, 15, 322

McNaughton, 1959, Scheduling with deadlines and loss functions, Management Science, 6, 1, 10.1287/mnsc.6.1.1

Saltzman, 1987, A two-process implicit enumeration algorithm for the simple assembly line balancing problem, European Journal of Operational Research, 32, 118, 10.1016/0377-2217(87)90276-1

Scholl, 1993, Data of assembly line balancing problems, Schriften zur Quantitativen Betriebswirtschaftslehre, 16

Scholl, 1994, Ein B & B-Verfahren zur Abstimmung von Fließbändern bei gegebener Stationsanzahl, 175

Scholl, 1995

Scholl, 1994, Combining the power of FABLE and EUREKA for assembly line balancing — A bidirectional branch and bound procedure, Schriften zur Quantitativen Betriebswirtschaftslehre, 7

Scholl, 1994, Simple assembly line balancing — Heuristic approaches, Schriften zur Quantitativen Betriebswirtschaftslehre, 2

Schrage, 1978, Dynamic programming solution of sequencing problems with precedence constraints, Operations Research, 26, 444, 10.1287/opre.26.3.444

Talbot, 1984, An integer programming algorithm with network cuts for solving the assembly line balancing problem, Management Science, 30, 85, 10.1287/mnsc.30.1.85

Talbot, 1986, A comparative evaluation of heuristic line balancing techniques, Management Science, 32, 430, 10.1287/mnsc.32.4.430

Wee, 1981, An efficient branch and bound algorithm for an assembly line balancing problem — Part II: Maximize the production rate