Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed (Q4514799)
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 1530367
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed |
scientific article; zbMATH DE number 1530367 |
Statements
28 June 2001
0 references
scheduling
0 references
bicriteria problem
0 references
minimizing number of tardy jobs and maximum earliness
0 references
single machine
0 references
polynomial time algorithm
0 references
0.978948712348938
0 references
0.8672917485237122
0 references
0.8564543724060059
0 references
0.8499259948730469
0 references
0.841839075088501
0 references
Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed (English)
0 references
