Narrow search
Showing 31 - 40 of 648,142
Cover Image
An improved branch-cut-and-price algorithm for parallel machine scheduling problems
Oliveira, Daniel Ribeiro de; Pessoa, Artur - In: INFORMS journal on computing : JOC 32 (2020) 1, pp. 90-100
Persistent link: https://www.econbiz.de/10012182988
Cover Image
A branch-and-price algorithm for the two-dimensional level strip packing problem
Bettinelli, Andrea; Ceselli, Alberto; Righini, Giovanni - In: 4OR : a quarterly journal of operations research 6 (2008) 4, pp. 361-374
Persistent link: https://www.econbiz.de/10003798139
Cover Image
A theoretical development for the total tardiness problem and its application in branch and bound algorithm
Zhou, Shuyu; Liu, Zhaohui - In: Computers & operations research : and their … 40 (2013) 1, pp. 248-252
Persistent link: https://www.econbiz.de/10009657960
Cover Image
A branch-and-bound algorithm for shift scheduling with nonstationary demand
Defraeye, Mieke; Van Nieuwenhuyse, Inneke - 2013
Persistent link: https://www.econbiz.de/10010238524
Cover Image
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
Cover Image
Estimation of processing time using machine learning and real factory data for optimization of parallel machine scheduling problem
Yamashiro, Hirochika; Nonaka, Hirofumi - In: Operations research perspectives 8 (2021), pp. 1-9
Light gradient-boosted machine (LightGBM) algorithm and Ridge performed the best with MAPE and RMSE. The optimization of …
Persistent link: https://www.econbiz.de/10012596666
Cover Image
A Branch-and-Bound Algorithm for Shift Scheduling with Nonstationary Demand
Defraeye, Mieke; Van Nieuwenhuyse, Inneke - 2014
with nonstationary demand and (stochastic) service level constraints. The algorithm is intended for personnel planning in … computational experiments show that the algorithm efficiently explores the solution space and quickly finds an optimum (even if an …
Persistent link: https://www.econbiz.de/10014037733
Cover Image
A geometric branch-and-bound algorithm for the service bundle design problem
Li, Yifu; Qi, Xiangtong - In: European journal of operational research : EJOR 303 (2022) 3, pp. 1044-1056
Persistent link: https://www.econbiz.de/10013366181
Cover Image
A Geometric Branch-and-Bound Algorithm for the Service Bundle Design Problem
Li, Yifu; Qi, Xiangtong - 2022
. To solve the problem, we design a novel geometric branch-and-bound algorithm. The algorithm divides the objective … algorithm can solve the service bundle design problem efficiently …
Persistent link: https://www.econbiz.de/10014085467
Cover Image
Minimization of maximum lateness on parallel machines with a single server and job release dates
Elidrissi, Abdelhak; Benmansour, Rachid; Zufferey, Nicolas - In: 4OR : quarterly journal of the Belgian, French and … 22 (2024) 3, pp. 351-385
Persistent link: https://www.econbiz.de/10015071756