Skip to contents

  1. Rostami, Salim [Author]; Creemers, Stefan [Author]; Leus, Roel [Author]

    Precedence theorems and dynamic programming for the single-machine weighted tardiness problem

    Books
    View online
    Close

    Bookmarks

    You can manage bookmarks using lists, please log in to your user account for this.

    Leuven, België: KU Leuven, Faculty of Economics and Business, [2017]

    Published in: Katholieke Universiteit Leuven: KBI ; 20171500

  2. Happach, Felix [Author]

    Makespan minimization with OR-precedence constraints

    Articles
    View online
    Close

    Bookmarks

    You can manage bookmarks using lists, please log in to your user account for this.

    2021

    Published in: Journal of scheduling ; 24(2021), 3 vom: Juni, Seite 319-328

  3. Kasapidis, Gregory A. [Author]; Dauzère-Péres, Stéphane [Author]; Paraskevopoulos, Dimitris C. [Author]; Repoussis, Panagiotis P. [Author]; Tarantilis, Christos D. [Author]

    On the multiresource flexible job-shop scheduling problem with arbitrary precedence graphs

    Articles
    View online
    Close

    Bookmarks

    You can manage bookmarks using lists, please log in to your user account for this.

    2023

    Published in: Production and operations management ; 32(2023), 7 vom: Juli, Seite 2322-2330

  4. Álvarez-Miranda, Eduardo [Author]; Pereira, Jordi [Author]; Vilà, Mariona [Author]

    A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem

    Articles
    View online
    Close

    Bookmarks

    You can manage bookmarks using lists, please log in to your user account for this.

    2024

    Published in: Computers & operations research ; 166(2024) vom: Juni, Artikel-ID 106597, Seite 1-16

  5. Braune, Roland [Author]

    Packing-based branch-and-bound for discrete malleable task scheduling

    Articles
    View online
    Close

    Bookmarks

    You can manage bookmarks using lists, please log in to your user account for this.

    2022

    Published in: Journal of scheduling ; 25(2022), 6 vom: Dez., Seite 675-704