Batch scheduling and common due date assignment problem: An NP-hard case (Q1382284)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1133178
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Batch scheduling and common due date assignment problem: An NP-hard case |
scientific article; zbMATH DE number 1133178 |
Statements
Batch scheduling and common due date assignment problem: An NP-hard case (English)
0 references
19 August 1998
0 references
computational complexity
0 references
0.8535526394844055
0 references
0.8323203325271606
0 references
