Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs (Q1043248): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.orl.2009.09.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2023687380 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 07:06, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs |
scientific article |
Statements
Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs (English)
0 references
7 December 2009
0 references
algorithm
0 references
scheduling
0 references
release time
0 references
late job
0 references
time complexity
0 references
