Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem (Q1772847)
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: Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem |
scientific article; zbMATH DE number 2160299
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem |
scientific article; zbMATH DE number 2160299 |
Statements
Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem (English)
0 references
21 April 2005
0 references
Scheduling
0 references
Open shop scheduling
0 references
Parallel machine scheduling
0 references
Separable non-decreasing function
0 references
0 references
0 references
0 references
0 references
