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 |
-
Yaghtin, Mohammad, (2025)
-
Kim, Jun, (2022)
-
Li, Yantong, (2022)
- More ...
-
Extended guest editorial : smart product platforming in the industry 4.0 era and beyond
Zhang, Linda L., (2025)
-
Delivery routing for electric vehicles with en-route mobile battery swapping
Xiao, Jiuhong, (2024)
-
A meta-auction for on-demand transportation procurement in Industry 5.0
Xu, Su Xiu, (2025)
- More ...