Similar Search Results

A Branch-and-Bound Algorithm for the Proactive Resource-Constrained Project Scheduling Problem with Robustness Maximization Objective

Li, Xue; He, Zheng; Wang, Nengmin - 2023

This paper proposes a branch-and-bound algorithm (B&B) for the proactive scheduling problem, which incorporates a … degree of anticipation for variability in practical projects. First, the resource-constrained proactive scheduling model is … resource conflict in the upper-bound solution. Third, we solve the resource-constrained proactive scheduling problem with the …

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

CliSAT : a new exact algorithm for hard maximum clique problems

San Segundo, Pablo; Furini, Fabio; Álvarez, David; … - In: European journal of operational research : EJOR 307 (2023) 3, pp. 1008-1025

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

Features for the 0-1 knapsack problem based on inclusionwise maximal solutions

Jooken, Jorik; Leyman, Pieter; De Causmaecker, Patrick - In: European journal of operational research : EJOR 311 (2023) 1, pp. 36-55

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

A branch-and-bound algorithm for the proactive resource-constrained project scheduling problem with a robustness maximization objective

Li, Xue; He, Zhengwen; Wang, Nengmin - In: Computers & operations research : an international journal 166 (2024), pp. 1-19

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

Solving the Set Covering Problem with Conflicts on Sets : a new parallel GRASP

Carrabs, Francesco; Cerulli, Raffaele; Mansini, Renata; … - In: Computers & operations research : an international journal 166 (2024), pp. 1-18

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

Minimizing the makespan on two parallel machines with a common server in charge of loading and unloading operations

Elidrissi, Abdelhak; Benmansour, Rachid; Hasani, Keramat; … - In: Computers & operations research : an international journal 167 (2024), pp. 1-20

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

A new composite heuristic to minimize the total tardiness for the single machine scheduling problem with variable and flexible maintenance

Costa, Antonio; Corsini, Roberto Rosario; Pagano, Daniele; … - In: Computers & operations research : an international journal 173 (2025), pp. 1-14

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

A new class of hard problem instances for the 0-1 knapsack problem

Jooken, Jorik; Leyman, Pieter; De Causmaecker, Patrick - In: European journal of operational research : EJOR 301 (2022) 3, pp. 841-854

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

Branch and solve strategies-based algorithm for the quadratic multiple knapsack problem

Aïder, Méziane; Gacem, Oussama; Hifi, Mhand - In: Journal of the Operational Research Society 73 (2022) 3, pp. 540-557

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

Novel efficient formulation and matheuristic for large-sized unrelated parallel machine scheduling with release dates

Li, Yantong; Côté, Jean-François; Coelho, Leandro C.; … - In: International journal of production research 60 (2022) 20, pp. 6104-6123

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