A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates (Q2434249): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:49, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates |
scientific article |
Statements
A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates (English)
0 references
5 February 2014
0 references
bicriteria scheduling
0 references
due date assignment
0 references
convex controllable processing times
0 references
resource allocation
0 references
