Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation (Q5059190): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q129158418, #quickstatements; #temporary_batch_1724714016629 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129158418 / rank | |||
Normal rank | |||
Latest revision as of 01:23, 27 August 2024
scientific article; zbMATH DE number 7637040
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation |
scientific article; zbMATH DE number 7637040 |
Statements
Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation (English)
0 references
23 December 2022
0 references
single-machine scheduling
0 references
minmax
0 references
common due-window
0 references
convex resource allocation
0 references
position-dependent workloads
0 references
0 references
0 references
0 references
0 references
