Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times (Q1964481): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4859840 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimizing late jobs in the general one machine scheduling problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property / 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 | |||
Latest revision as of 12:00, 29 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times |
scientific article |
Statements
Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times (English)
0 references
6 November 2001
0 references
single-machine scheduling
0 references
preemptive scheduling
0 references
late jobs
0 references
dynamic programming
0 references
0 references
0 references
