Search Results - subject:"branch and bound"

Integrated staffing and scheduling for an aircraft line maintenance problem

Belien, Jeroen; Demeulemeester, Erik; Cardoen, Brecht - Faculteit Economie en Bedrijfswetenschappen, … - 2010

programming approach and solve it heuristically using a branch-and-bound enumeration framework. Each node of the tree represents a …

Persistent link: https://www.econbiz.de/10009421633

Sequencing mixed-model assembly lines to minimise the number of work overload situations

Boysen, Nils; Kiel, Mirko; Scholl, Armin - Wirtschaftswissenschaftliche Fakultät, … - 2010

The mixed-model sequencing problem is to sequence different product models launched down an assembly line, so that work overload at the stations induced by direct succession of multiple labour-intensive models is avoided. As a concept of clearing overload situations, especially applied by...

Persistent link: https://www.econbiz.de/10008568613

Scheduling multiprocessor tasks to minimise the makespan on two dedicated processors

Manaa, Adel; Chu, Chengbin - In: European Journal of Industrial Engineering 4 (2010) 3, pp. 265-279

-case analysis and its generalisation to any semi-active schedule. A set of dominance properties are established and a branch-and-bound …

Persistent link: https://www.econbiz.de/10008755652

Single-machine scheduling with inserted idle time to minimise a weighted quadratic function of job lateness

Soroush, H.M. - In: European Journal of Industrial Engineering 4 (2010) 2, pp. 131-166

effective branching rules into a Branch-and-Bound (B&B) algorithm to discard dominated branches. Our computational results …

Persistent link: https://www.econbiz.de/10008755656

Solution of multidimensional knapsack problems via cooperation of dynamic programming and branch and bound

Boyer, Vincent; Baz, Didier El; Elkihel, Moussa - In: European Journal of Industrial Engineering 4 (2010) 4, pp. 434-449

combines dynamic programming and branch and bound. Our method makes cooperate a dynamic programming heuristics based on … surrogate relaxation and a branch and bound procedure. Our algorithm was tested for several randomly generated test sets and … well-known existing heuristics. Then, our exact cooperative method is compared with a classical branch and bound algorithm …

Persistent link: https://www.econbiz.de/10008755658

An efficient combined DCA and B&B using DC/SDP relaxation for globally solving binary quadratic programs

Dinh, Tao Pham; Canh, Nam Nguyen; Thi, Hoai Le - In: Journal of Global Optimization 48 (2010) 4, pp. 595-632

Persistent link: https://www.econbiz.de/10008775635

On convex relaxations of quadrilinear terms

Cafieri, Sonia; Lee, Jon; Liberti, Leo - In: Journal of Global Optimization 47 (2010) 4, pp. 661-685

Persistent link: https://www.econbiz.de/10008456031

Transformation of two-dimensional unconstrained cutting problems into a set of one-dimensional knapsack problems

Wilt, Ann van der - 1990

Persistent link: https://www.econbiz.de/10000781861

Stochastic branch & bound applying target oriented branch & bound method to optimal scenario tree reduction

Stix, Volker - 2001

In this article a new branch & bound method is described. It uses an artificial target to improve its bounding capabilities. Therefore the new approach is faster compared to the classical one....

Persistent link: https://www.econbiz.de/10005841591

Target oriented branch & bound method for global optimization

Stix, Volker - Institut für Informationsverarbeitung und -wirtschaft … - 2001

We introduce a very simple but efficient idea for branch & bound (B&B) algorithms in global optimization (GO). As input for our generic algorithm, we need an upper bound algorithm for the GO maximization problem and a branching rule....

Persistent link: https://www.econbiz.de/10005841592