A two-machine flowshop problem with processing time-dependent buffer constraints : an application in multimedia presentations
Year of publication: |
2009
|
---|---|
Authors: | Lin, Feng-cheng ; Hong, Jen-shin ; Lin, Bertrand M. T. |
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. 36.2009, 4, p. 1158-1175
|
Subject: | Internet | Breitbandkommunikation | Broadband communications | Multimedia | Durchlaufzeit | Lead time | Scheduling-Verfahren | Scheduling problem | Branch-and-Bound | Branch and Bound | Theorie | Theory |
-
Detienne, Boris, (2016)
-
Rakrouki, Mohamed Ali, (2020)
-
Makespan minimization on a two-machine flowshop with an availability constraint on the first machine
Hnaien, Faicel, (2015)
- More ...
-
Kononov, Alexander, (2012)
-
Server scheduling on parallel dedicated machines with fixed job sequences
Cheng, T.C.E., (2019)
-
Minimizing the total weighted completion time in the relocation problem
Kononov, Alexander V., (2010)
- More ...