Preemptive scheduling on a hypercube
Year of publication: |
1989
|
---|---|
Authors: | VanHoesel, C. P. |
Publisher: |
Bonn : Forschungsinst. für Diskrete Mathematik |
Subject: | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Algorithmus | Algorithm |
Extent: | 11 S. graph. Darst. |
---|---|
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 ...
-
Economic lot-sizing with start-up costs : the convex hull
VanHoesel, C. P., (1991)
-
Fully polynomial approximation schemes for single-item capacitated economic lot-sizing problems
VanHoesel, C. P., (1997)
-
On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs
Eijl, C. A. van, (1995)
- More ...