Lower bounds for scheduling a single robot in a job-shop environment (Q1854757)
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 scheduling a single robot in a job-shop environment |
scientific article; zbMATH DE number 1859495
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds for scheduling a single robot in a job-shop environment |
scientific article; zbMATH DE number 1859495 |
Statements
Lower bounds for scheduling a single robot in a job-shop environment (English)
0 references
27 January 2003
0 references
scheduling
0 references
traveling salesman problem with time windows
0 references
time-lags
0 references
lower bounds
0 references
constraint propagation
0 references
column generation
0 references
