A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
| Year of publication: |
2012
|
|---|---|
| Authors: | Liu, Peihai ; Lu, Xiwen ; Fang, Yang |
| Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 15.2012, 1, p. 77-81
|
| Subject: | Theorie | Theory | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Operations Research | Operations research | Produktionssteuerung | Production control |
-
Exact algorithms to minimize makespan on single and parallel batch processing machines
Muter, İbrahim, (2020)
-
Rostami, Mohammad, (2020)
-
Yamashiro, Hirochika, (2021)
- More ...
-
Optimal on-line algorithms for one batch machine with grouped processing times
Yang, Fang, (2011)
-
A note on minimizing total weighted completion time with an unexpected machine unavailable interval
Liu, Peihai, (2019)
-
Integrated production and job delivery scheduling with an availability constraint
Liu, Peihai, (2016)
- More ...