Characterizing the set of feasible sequences for n jobs to be carried out on a single machine (Q1135762)
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: Characterizing the set of feasible sequences for n jobs to be carried out on a single machine |
scientific article; zbMATH DE number 3662871
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Characterizing the set of feasible sequences for n jobs to be carried out on a single machine |
scientific article; zbMATH DE number 3662871 |
Statements
Characterizing the set of feasible sequences for n jobs to be carried out on a single machine (English)
0 references
1980
0 references
single machine
0 references
scheduling
0 references
0 references
