A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan
Year of publication: |
2014
|
---|---|
Authors: | Liu, Peihai ; Lu, Xiwen |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 51.2014, p. 251-256
|
Subject: | Scheduling | Flow shop | Online | Competitive ratio | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Durchlaufzeit | Lead time | Produktionssteuerung | Production control | Online-Handel | Online retailing | Theorie | Theory |
-
Flow shop makespan minimization scheduling with deteriorating jobs under dominating machines
Sun, Linhui, (2012)
-
Hadda, Hatem, (2015)
-
A note on "minimizing makespan in three machine flow shop with deteriorating jobs"
Jafari, Abbas-Ali, (2016)
- More ...
-
Optimal on-line algorithms for one batch machine with grouped processing times
Yang, Fang, (2011)
-
A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
Liu, Peihai, (2012)
-
Integrated production and job delivery scheduling with an availability constraint
Liu, Peihai, (2016)
- More ...