Single Machine Scheduling and Selection to Minimize Total Flow Time with Minimum Number Tardy (Q4273247)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Single Machine Scheduling and Selection to Minimize Total Flow Time with Minimum Number Tardy |
scientific article; zbMATH DE number 474895
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Single Machine Scheduling and Selection to Minimize Total Flow Time with Minimum Number Tardy |
scientific article; zbMATH DE number 474895 |
Statements
Single Machine Scheduling and Selection to Minimize Total Flow Time with Minimum Number Tardy (English)
0 references
2 January 1994
0 references
sequencing \(N\) jobs on a single machine
0 references
total flow time
0 references
minimum number of tardy jobs
0 references
branch-and-bound
0 references
optimal selection of jobs
0 references
