Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms
Year of publication: |
1992
|
---|---|
Authors: | Galambos, Gábor ; Vliet, André van |
Publisher: |
Amsterdam [u.a.] : Tinbergen Inst. |
Subject: | Theorie | Theory | Operations Research | Operations research | Algorithmus | Algorithm |
-
Scheduling flow shops with blocking using a discrete self-organising migrating algorithm
Davendra, Donald, (2013)
-
Baker, Tim, (2012)
-
Online algorithms for scheduling two parallel machines with a single server
Jiang, Yiwei, (2015)
- More ...
-
An exact algorithm for scheduling identical coupled tasks
Ahr, Dino, (2004)
-
A branch-and-bound algorithm for the coupled task problem
Békési, József, (2014)
-
On-Line Bin Packing - A Restricted Survey
Galambos, Gábor, (1995)
- More ...