Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times (Q5865923): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1142/s0217595921500238 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3160324153 / rank | |||
Normal rank | |||
Latest revision as of 09:24, 30 July 2024
scientific article; zbMATH DE number 7539543
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times |
scientific article; zbMATH DE number 7539543 |
Statements
Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times (English)
0 references
10 June 2022
0 references
parallel-batch scheduling
0 references
release dates
0 references
Pareto optimization
0 references
polynomial-time algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
