On-line scheduling on a single machine: Maximizing the number of early jobs (Q5929136): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
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 | |||
Property / cites work | |||
Property / cites work: Q2768123 / 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: Q4055377 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Online algorithms. The state of the art / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Scheduling Parallel Machines On-Line / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2753958 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4368485 / rank | |||
Normal rank |
Revision as of 15:23, 3 June 2024
scientific article; zbMATH DE number 1588391
Language | Label | Description | Also known as |
---|---|---|---|
English | On-line scheduling on a single machine: Maximizing the number of early jobs |
scientific article; zbMATH DE number 1588391 |
Statements
On-line scheduling on a single machine: Maximizing the number of early jobs (English)
0 references
3 September 2002
0 references
combinatorial problems
0 references
online algorithms
0 references
competitive analysis
0 references
worst-case bounds
0 references
single-machine scheduling
0 references
0 references
0 references