Similar Search Results

Exact algorithms for single-machine scheduling with time windows and precedence constraints

Davari, Morteza; Demeulemeester, Erik; Leus, Roel; … - In: Journal of scheduling 19 (2016) 3, pp. 309-334

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

An exact algorithm for parallel machine scheduling with conflicts

Kowalczyk, Daniel; Leus, Roel - In: Journal of scheduling 20 (2017) 4, pp. 355-372

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

A branch-and-price algorithm for parallel machine scheduling using ZDDs and generic branching

Kowalczyk, Daniel; Leus, Roel - In: INFORMS journal on computing : JOC 30 (2018) 4, pp. 768-782

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

An exact algorithm for parallel machine scheduling with conflicts

Kowalczyk, Daniel; Leus, Roel - 2015

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

A branch-and-bound algorithm for stable scheduling in single-machine production systems

Leus, Roel; Herroelen, Willy S. - 2004

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

Managing technology risk in R&D project planning : optimal timing and parallelization of R&D activities

Crama, Pascale; De Reyck, Bert; Degraeve, Zeger; Leus, Roel - 2005

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

Two branch-and-bound algorithms for the robust parallel machine scheduling problem

Ranjbar, Mohammad; Davari, Morteza; Leus, Roel - In: Computers & operations research : and their … 39 (2012) 7, pp. 1652-1660

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

A branch-and-price algorithm for parallel machine scheduling using ZDDs and generic branching

Kowalczyk, D.; Leus, Roel - 2016

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

Parallel machine scheduling under uncertainty : models and exact algorithms

Song, Guopeng; Leus, Roel - In: INFORMS journal on computing : JOC ; charting new … 34 (2022) 6, pp. 3059-3079

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

A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching

Kowalczyk, Daniel - 2016

We study the parallel machine scheduling problem to minimize the sum of the weighted completion times of the jobs to be scheduled (problem Pm||ΣwjCj in the standard three-field notation). We use the set covering formulation that was introduced by van den Akker et al. (1999) for this problem,...

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