A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem (Q1771351)
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: A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem |
scientific article; zbMATH DE number 2159753
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem |
scientific article; zbMATH DE number 2159753 |
Statements
A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem (English)
0 references
21 April 2005
0 references
Parallel machines scheduling problem
0 references
Preemptive scheduling
0 references
Combinatorial optimization
0 references
0 references
0 references
0 references
0 references
