Narrow search
Showing 1 - 10 of 82
Cover Image
How important are branching decisions : fooling MIP solvers
Le Bodic, Pierre; Nemhauser, George L. - In: Operations research letters 43 (2015) 3, pp. 273-278
Persistent link: https://www.econbiz.de/10011309550
Cover Image
An exact algorithm to minimize mean squared deviation of job completion times about a common due date
Srirangacharyulu, B.; Srinivasan, G. - In: European journal of operational research : EJOR 231 (2013) 3, pp. 547-556
Persistent link: https://www.econbiz.de/10009787396
Cover Image
A branch-and-bound procedure for forest harvest scheduling problems addressing aspects of habitat availability
Neto, Teresa; Constantino, Miguel Fragoso; Martins, Isabel - In: International transactions in operational research : … 20 (2013) 5, pp. 689-709
Persistent link: https://www.econbiz.de/10009790939
Cover Image
An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset
Morrison, David Robert; Sewell, Edward C.; Jacobson, … - In: European journal of operational research : EJOR 236 (2014) 2, pp. 403-409
Persistent link: https://www.econbiz.de/10010366188
Cover Image
An improved branch-and-bound algorithm for the one-machine scheduling problem with delayed precedence constraints
Zhang, Wenda; Sauppe, Jason J.; Jacobson, Sheldon H. - In: INFORMS journal on computing : JOC 33 (2021) 3, pp. 1091-1102
Persistent link: https://www.econbiz.de/10012631649
Cover Image
Minimize total tardiness and machine unavailability on single machine scheduling problem : bi-objective branch and bound algorithm
Khoudi, Asmaa; Berrichi, Ali - In: Operational research : an international journal 20 (2020) 3, pp. 1763-1789
Persistent link: https://www.econbiz.de/10012291249
Cover Image
A branch-and-bound algorithm for the prize-collecting single-machine scheduling problem with deadlines and total tardiness minimization
Cordone, Roberto; Hosteins, Pierre; Righini, Giovanni - In: INFORMS journal on computing : JOC 30 (2018) 1, pp. 168-180
Persistent link: https://www.econbiz.de/10011848225
Cover Image
An efficient branch and bound algorithm for smoothing the workloads on simple assembly lines
Hazır, Öncü; Agi, Maher A. N.; Guérin, Jérémy - In: International journal of production research 59 (2021) 2, pp. 617-634
Persistent link: https://www.econbiz.de/10012425198
Cover Image
A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem
Álvarez-Miranda, Eduardo; Pereira, Jordi; Vilà, Mariona - In: Computers & operations research : an international journal 166 (2024), pp. 1-16
Persistent link: https://www.econbiz.de/10014563804
Cover Image
Nonsequential appointment scheduling with a random number of requests
Zhu, Yan; Liu, Zhixin; Qi, Xiangtong - In: Production and operations management : the flagship … 33 (2024) 1, pp. 184-204
Persistent link: https://www.econbiz.de/10014575548