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
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10951-010-0208-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2029826506 / rank | |||
Normal rank | |||
Revision as of 01:54, 20 March 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
