Similar Search Results

An exact algorithm for parallel machine scheduling with conflicts

Kowalczyk, Daniel; Leus, Roel - 2015

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

Exact algorithms for a parallel machine scheduling problem with workforce and contiguity constraints

Caselli, Giulia; Delorme, Maxence; Iori, Manuel; Magni, … - In: Computers & operations research : an international journal 163 (2024), pp. 1-15

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

Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs

Pferschy, Ulrich; Resch, Julia; Righini, Giovanni - In: Journal of scheduling : JOS 26 (2023) 3, pp. 267-287

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

A constructive branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints

Watermeyer, Kai; Zimmermann, Jürgen - In: Journal of scheduling : JOS 26 (2023) 1, pp. 95-111

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

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

Solving the RCPSP efficiently at modest memory requirements

Sprecher, Arno - 1996

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

The robust machine availability problem

Song, G.; Kowalczyk, D.; Leus, Roel - 2017

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

A novel core-based optimization framework for binary integer programs- the multidemand multidimesional Knapsack problem as a test problem

Al-Shihabi, Sameh - In: Operations research perspectives 8 (2021), pp. 1-13

The effectiveness and efficiency of optimization algorithms might deteriorate when solving large-scale binary integer programs (BIPs). Consequently, researchers have tried to fix the values of certain variables called adjunct variables, and only optimize a small problem version formed from the...

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

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

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