A polynomial-time algorithm for a flow-shop batching problem with equal-length operations
Year of publication: |
2011
|
---|---|
Authors: | Brucker, Peter ; Shakhlevich, Natasha |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 14.2011, 4, p. 371-389
|
Subject: | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm |
-
A review of methods and algorithms for optimizing construction scheduling
Zhou, J., (2013)
-
Online algorithms for scheduling two parallel machines with a single server
Jiang, Yiwei, (2015)
-
Robust MILP formulations for the two-stage weighted vertex p-center problem
Duran-Mateluna, Cristian, (2023)
- More ...
-
Inverse scheduling : two-machine flow-shop problem
Brucker, Peter, (2011)
-
Inverse scheduling with maximum lateness objective
Brucker, Peter, (2009)
-
Brucker, Peter, (2016)
- More ...