Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates (Q2482802)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates |
scientific article; zbMATH DE number 5267304
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates |
scientific article; zbMATH DE number 5267304 |
Statements
Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates (English)
0 references
24 April 2008
0 references
parallel machine scheduling
0 references
earliness-tardiness
0 references
just-in-time
0 references
lower bounds
0 references
IP time-indexed formulation
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.92411214
0 references
0.92117596
0 references
0.91530704
0 references
0.9146186
0 references
0.9141842
0 references
0.91230226
0 references
0.9027684
0 references
0.9023185
0 references
0.9007258
0 references
