A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times (Q1799381)
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 polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times |
scientific article; zbMATH DE number 6958399
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times |
scientific article; zbMATH DE number 6958399 |
Statements
A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times (English)
0 references
18 October 2018
0 references
scheduling
0 references
makespan criterion
0 references
availability constraints
0 references
0.9074684977531432
0 references
0.8694133758544922
0 references
0.8298096060752869
0 references
0.8098954558372498
0 references
0.809787929058075
0 references
