Computing lower and upper bounds for a large-scale industrial job shop scheduling problem (Q1011298)
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: Computing lower and upper bounds for a large-scale industrial job shop scheduling problem |
scientific article; zbMATH DE number 5541455
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing lower and upper bounds for a large-scale industrial job shop scheduling problem |
scientific article; zbMATH DE number 5541455 |
Statements
Computing lower and upper bounds for a large-scale industrial job shop scheduling problem (English)
0 references
8 April 2009
0 references
scheduling
0 references
batching
0 references
tabu search
0 references
mathematical programming
0 references
0 references
0 references
0 references
