Online scheduling of ordered flow shops
Year of publication: |
1 January 2019
|
---|---|
Authors: | Lee, Kangbok ; Zheng, Feifeng ; Pinedo, Michael |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 272.2019, 1 (1.1.), p. 50-60
|
Subject: | Online scheduling | Flow shop | Makespan | Best possible algorithm | Competitive ratio | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Durchlaufzeit | Lead time | Online-Handel | Online retailing | Konsumentenverhalten | Consumer behaviour |
-
A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan
Liu, Peihai, (2014)
-
Online algorithms for scheduling two parallel machines with a single server
Jiang, Yiwei, (2015)
-
Shop scheduling problems with pliable jobs
Knust, Sigrid, (2019)
- More ...
-
Zheng, Feifeng, (2019)
-
Inventory constrained scheduling on a single machine
Briskorn, Dirk, (2008)
-
Allocating containers to ships with fixed departure times
Choi, Byung-Cheon, (2008)
- More ...