Non-preemptive two-machine open shop scheduling with non-availability constraints (Q1395372)
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: Non-preemptive two-machine open shop scheduling with non-availability constraints |
scientific article; zbMATH DE number 1940722
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Non-preemptive two-machine open shop scheduling with non-availability constraints |
scientific article; zbMATH DE number 1940722 |
Statements
Non-preemptive two-machine open shop scheduling with non-availability constraints (English)
0 references
26 June 2003
0 references
open shop scheduling
0 references
availability constraints
0 references
worst-case analysis
0 references
0.9310826659202576
0 references
0.9206621050834656
0 references
0.8614240288734436
0 references
0.8610643148422241
0 references
