Semi-online scheduling on two identical machines with a common due date to maximize total early work (Q827603): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q115198393, #quickstatements; #temporary_batch_1707252663060 |
Removed claim: author (P16): Item:Q224835 |
||
| Property / author | |||
| Property / author: Jacek Błażewicz / rank | |||
Revision as of 08:11, 11 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Semi-online scheduling on two identical machines with a common due date to maximize total early work |
scientific article |
Statements
Semi-online scheduling on two identical machines with a common due date to maximize total early work (English)
0 references
13 January 2021
0 references
semi-online scheduling
0 references
parallel machines
0 references
early work maximization
0 references
