A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates (Q2434249)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6255096
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates |
scientific article; zbMATH DE number 6255096 |
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
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8690351247787476
0 references
0.8632208704948425
0 references
0.8611859083175659
0 references
0.8502617478370667
0 references
