Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property (Q1341403): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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 <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4099215 / 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: A Functional Equation and its Application to Resource Allocation and Sequencing Problems / rank | |||
Normal rank | |||
Latest revision as of 11:07, 23 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property |
scientific article |
Statements
Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property (English)
0 references
11 January 1995
0 references
tower of sets
0 references
processing time
0 references
release date
0 references
due date
0 references
Moore-Hodgson algorithm
0 references
knapsack-like problem
0 references
nested inequality constraints
0 references
0 references
0 references
