Production planning problem with sequence dependent setups as a bilevel programming problem (Q2467304)
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: Production planning problem with sequence dependent setups as a bilevel programming problem |
scientific article; zbMATH DE number 5228769
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Production planning problem with sequence dependent setups as a bilevel programming problem |
scientific article; zbMATH DE number 5228769 |
Statements
Production planning problem with sequence dependent setups as a bilevel programming problem (English)
0 references
21 January 2008
0 references
production
0 references
two machines
0 references
sequence dependent setup times
0 references
bilevel mixed 0-1 integer programming problem
0 references
heuristics based on tabu search
0 references
0 references
0 references
0.7432101368904114
0 references
0.7407262921333313
0 references
0.72990483045578
0 references
