A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times (Q1799381)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times |
scientific article |
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
