A heuristic for maximizing the number of on-time jobs on two uniform parallel machines (Q3423282): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/nav.20161 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2038586658 / rank | |||
Normal rank | |||
Latest revision as of 15:26, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A heuristic for maximizing the number of on-time jobs on two uniform parallel machines |
scientific article |
Statements
A heuristic for maximizing the number of on-time jobs on two uniform parallel machines (English)
0 references
20 February 2007
0 references
scheduling
0 references
uniform parallel machines
0 references
due dates
0 references
worst-case bounds
0 references
approximation algorithms
0 references
