Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints (Q2576249)
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: Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints |
scientific article; zbMATH DE number 2241321
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints |
scientific article; zbMATH DE number 2241321 |
Statements
Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints (English)
0 references
27 December 2005
0 references
scheduling theory
0 references
identical parallel machines
0 references
open shop
0 references
0.8864508867263794
0 references
0.869461715221405
0 references
0.841804027557373
0 references
0.8321400880813599
0 references
