Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances (Q969755)
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 5705530
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances |
scientific article; zbMATH DE number 5705530 |
Statements
Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances (English)
0 references
7 May 2010
0 references
sequencing and scheduling
0 references
single machine
0 references
tardy jobs
0 references
deadlines
0 references
0 references
0 references
0 references
0.843142569065094
0 references
0.8210173845291138
0 references
0.8059906363487244
0 references
0.8049533367156982
0 references
0.8024215698242188
0 references
