Search Results - subject:"branch and bound"

Two-machine flow shop scheduling of polyurethane foam production

Lin, Bertrand M.T.; Lin, Y.-Y.; Fang, K.-T. - In: International Journal of Production Economics 141 (2013) 1, pp. 286-294

time. The studied problem is strongly NP-hard. In this paper, we propose a branch-and-bound algorithm incorporating a lower …

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

Shortest path problem with forbidden paths: The elementary version

Di Puglia Pugliese, Luigi; Guerriero, Francesca - In: European Journal of Operational Research 227 (2013) 2, pp. 254-267

This paper addresses the elementary shortest path problem with forbidden paths. The main aim is to find the shortest paths from a single origin node to every other node of a directed graph, such that the solution does not contain any path belonging to a given set (i.e., the forbidden set). It is...

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

Minimising maximum lateness in a single machine scheduling problem with processing time-based aging effects

RadosÅ‚aw Rudek - In: European Journal of Industrial Engineering 7 (2013) 2, pp. 206-223

described by linear functions. Moreover, we construct the branch and bound method and implement well known approximation …

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

Active allocation of systematic risk and control of risk sensitivity in portfolio optimization

Li, Yingjie; Zhu, Shushang; Li, Donghui; Li, Duan - In: European Journal of Operational Research 228 (2013) 3, pp. 556-570

model. By exploiting such special problem characteristics, we design an efficient and globally convergent branch-and-bound …

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

Minimizing total tardiness for the order scheduling problem

Lee, Ik Sun - In: International Journal of Production Economics 144 (2013) 1, pp. 128-134

of objective are derived and tested along with the derived properties in a branch-and-bound scheme. The overall … performances of the proposed property, branch-and-bound and heuristic algorithms are evaluated via numerical experiments. …

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

Preserving an aging transit fleet: An optimal resource allocation perspective based on service life and constrained budget

Mishra, Sabyasachee; Sharma, Sushant; Khasnabis, Snehamay; … - In: Transportation Research Part A: Policy and Practice 47 (2013) C, pp. 111-123

remaining life of the fleet. Integer programming is used to solve the formulated optimization problem using branch and bound …

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

Reducing efficiently the search tree for multiprocessor job-shop scheduling problems

Carballo, Lester; Vakhania, Nodari; Werner, Frank - In: International journal of production research 51 (2013) 23/24, pp. 7105-7119

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

Minimizing total tardiness for the order scheduling problem

Lee, Ik Sun - In: International journal of production economics 144 (2013) 1, pp. 128-134

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

Restrict-and-relax search for 0-1 mixed-integer programs

Guzelsoy, Menal; Nemhauser, George L.; Savelsbergh, … - In: EURO journal on computational optimization 1 (2013) 1/2, pp. 201-218

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

Maximin Latin Hypercube Designs in Two Dimensions

van Dam, Edwin Robert; Den Hertog, Dick; Husslage, B.G.M.; … - Tilburg University, Center for Economic Research - 2005

The problem of finding a maximin Latin hypercube design in two dimensions can be described as positioning n non-attacking rooks on an n x n chessboard such that the minimal distance between pairs of rooks is maximized.Maximin Latin hypercube designs are important for the approximation and...

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