Heuristic algorithms for preemptive scheduling in a two-stage flowshop with unrelated parallel machines and \(0-1\) resource requirements (Q2932934)
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: Heuristic algorithms for preemptive scheduling in a two-stage flowshop with unrelated parallel machines and 0-1 resource requirements |
scientific article; zbMATH DE number 6378895
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Heuristic algorithms for preemptive scheduling in a two-stage flowshop with unrelated parallel machines and \(0-1\) resource requirements |
scientific article; zbMATH DE number 6378895 |
Statements
9 December 2014
0 references
preemptive scheduling
0 references
flowshop
0 references
parallel unrelated machines
0 references
resource constraints
0 references
heuristics
0 references
0.8882678747177124
0 references
0.8842724561691284
0 references
0.83107590675354
0 references
0.829399824142456
0 references
0.8244664669036865
0 references
