Single facility multi-class job scheduling (Q917435)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Single facility multi-class job scheduling |
scientific article; zbMATH DE number 4156187
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Single facility multi-class job scheduling |
scientific article; zbMATH DE number 4156187 |
Statements
Single facility multi-class job scheduling (English)
0 references
1990
0 references
Considered is the problem of scheduling jobs belonging to different classes on a single facility. Jobs are differentiated on the basis of their set-up times. Further, jobs belonging to the same class may differ from each other by their processing times. The problem is to find a schedule that minimizes mean flow time. The authors propose two approaches. The first, enumerative one, is based on a dynamic programming method. The second, heuristic one, is analyzed from the viewpoint of its worst-case and mean behavior.
0 references
single machine scheduling
0 references
mean flow time
0 references
worst-case
0 references
mean behavior
0 references
0 references
