On the exact upper bound for the multifit processor scheduling algorithm
Year of publication: |
1989
|
---|---|
Authors: | Yue, Minyi |
Publisher: |
Bonn : Forschungsinst. für Diskrete Mathematik [u.a.] |
Subject: | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm |
Extent: | 37 S. |
---|---|
Series: | Report. - Bonn : Univ., ISSN 0724-3138, ZDB-ID 1019256-6. |
Type of publication: | Book / Working Paper |
Language: | English |
Source: | ECONIS - Online Catalogue of the ZBW |
-
A review of methods and algorithms for optimizing construction scheduling
Zhou, J., (2013)
-
Online algorithms for scheduling two parallel machines with a single server
Jiang, Yiwei, (2015)
-
Robust MILP formulations for the two-stage weighted vertex p-center problem
Duran-Mateluna, Cristian, (2023)
- More ...
-
Yue, Minyi, (1990)
-
On a generalization of the Rado-Hall theorem to greedoids
Ding, Lijuan, (1986)
-
A simple proof of the inequality for the FFD bin-packing algorithm
Yue, Minyi, (1990)
- More ...