Approximate and branch-and-bound algorithms for the parallel machine scheduling problem with a single server
| Year of publication: |
2019
|
|---|---|
| Authors: | Liu, Guo-Sheng ; Li, Jin-Jin ; Yang, Hai-Dong ; Huang, George Q. |
| Published in: |
Journal of the Operational Research Society. - London : Taylor and Francis, ISSN 1476-9360, ZDB-ID 2007775-0. - Vol. 70.2019, 9, p. 1554-1570
|
| Subject: | Parallel machine scheduling | single server | worst-case analysis | branch and bound | SWPT | Scheduling-Verfahren | Scheduling problem | Branch-and-Bound | Branch and Bound | Theorie | Theory | Algorithmus | Algorithm | Produktionssteuerung | Production control |
-
A branch-and-price algorithm for parallel machine scheduling using ZDDs and generic branching
Kowalczyk, Daniel, (2018)
-
An improved branch-cut-and-price algorithm for parallel machine scheduling problems
Oliveira, Daniel Ribeiro de, (2020)
-
Kerkhove, Louis-Philippe, (2014)
- More ...
-
Spatial-temporal hedging coordination in prefabricated housing production
Zhai, Yue, (2020)
-
Online-to-offline ecommerce operations management (EOM) : editorial
Huang, George Q., (2020)
-
De, Arijit, (2020)
- More ...