Exact algorithms for single-machine scheduling with time windows and precedence constraints
Year of publication: |
June 2016
|
---|---|
Authors: | Davari, Morteza ; Demeulemeester, Erik ; Leus, Roel ; Talla Nobibon, Fabrice |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 19.2016, 3, p. 309-334
|
Subject: | Single-machine scheduling | Branch and bound | Mixed-integer programming | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Algorithmus | Algorithm | Branch-and-Bound | Branch and Bound | Ganzzahlige Optimierung | Integer programming |
-
Naderi, Bahman, (2020)
-
An improved branch-cut-and-price algorithm for parallel machine scheduling problems
Oliveira, Daniel Ribeiro de, (2020)
-
Experiments with parallel algorithms for combinatorial problems
Kindervater, G. A. P., (1988)
- More ...
-
Exact algorithms for singlemachine scheduling with time windows and precedence constraints
Davari, Morteza, (2013)
-
Two branch-and-bound algorithms for the robust parallel machine scheduling problem
Ranjbar, Mohammad, (2012)
-
Minimizing makespan on a single machine with release dates and inventory constraints
Davari, Morteza, (2020)
- More ...