On the representation of the one machine sequencing problem in the shifting bottleneck heuristic (Q879326)
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: On the representation of the one machine sequencing problem in the shifting bottleneck heuristic |
scientific article; zbMATH DE number 5151753
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the representation of the one machine sequencing problem in the shifting bottleneck heuristic |
scientific article; zbMATH DE number 5151753 |
Statements
On the representation of the one machine sequencing problem in the shifting bottleneck heuristic (English)
0 references
11 May 2007
0 references
scheduling
0 references
shifting bottleneck heuristic
0 references
single machine
0 references
due window
0 references
generalized lateness objective
0 references
0 references
0 references
0.8275656700134277
0 references
0.7976706624031067
0 references
0.7909307479858398
0 references
0.7909307479858398
0 references
