Search Results - subject:"branch and bound"

Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria

Gawiejnowicz, Stanisław; Suwalski, Cezary - In: Computers & operations research : and their … 52 (2014), pp. 135-146

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

Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness

Fernandez-Viagas, Victor; Framinan, Jose M. - In: Computers & operations research : and their … 64 (2015), pp. 86-96

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

Bicriteria scheduling problem for unrelated parallel machines with release dates

Lin, Yang-Kuei; Lin, Hao-Chen - In: Computers & operations research : and their … 64 (2015), pp. 28-39

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

Branch-andbound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions

Kacem, Imed; Souayah, Nizar; Haouari, Mohamed - In: RAIRO / Operations research 46 (2012) 2, pp. 125-147

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

A bottleneck-assignment based branch-and-bound algorithm to minimize the makespan in an m-machine permutation flowshop

Madhushini, N.; Rajendran, Chandrasekharan - In: Technology operation management : TOM ; official … 3 (2012) 1/2, pp. 1-10

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

The multi-resource agent bottleneck generalised assignment problem

Karsu, Özlem; Azizoǧlu, Meral - In: International journal of production research 50 (2012) 2, pp. 309-324

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

Reducing the 0-1 knapsack problem with a single continuous variable to the standard 0-1 knapsack problem

Büther, Marcel; Briskorn, Dirk - 2007

The 0-1 knapsack problem with a single continuous variable (KPC) is a natural extension of the binary knapsack problem (KP), where the capacity is not any longer fixed but can be extended which is expressed by a continuous variable. This variable might be unbounded or restricted by a lower or...

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

Exact Algorithms for the Matrix Bid Auction

Goossens, Dries - 2007

In a combinatorial auction, multiple items are for sale simultaneously to a set of buyers. These buyers are allowed to place bids on subsets of the available items. A special kind of combinatorial auction is the so-called matrix bid auction, which was developed by Day (2004). The matrix bid...

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

Developing a cellular manufacturing model considering the alternative routes, tool assignment, and machine reliability

Khorasgani, Sayyed Mahdi Sadat; Ghaffari, Mahdi - In: Journal of Industrial Engineering International 14 (2018) 3, pp. 627-636

efficiency and performance, several examples are solved by branch and bound (B&B) method. …

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

Optimizing a multiple objective surgical case scheduling problem

Cardoen, Brecht (contributor); … - 2006

programming and on im- plicit enumeration (branch-and-bound), will be introduced. These solution approaches will be thoroughly … programming, branch-and-bound 1 Introduction Health care is omnipresent in today’s developed world and has evolved towards a major … and consecutively enhanced in Section 3, whereas Section 4 describes both exact and heuristic branch-and-bound (B …

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