Applying available-to-promise (ATP) concept in mixed-model assembly line sequencing problems in a make-to-order (MTO) environment: problem extension, model formulation and Lagrangian relaxation algorithm (Q2656500)
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: Applying available-to-promise (ATP) concept in mixed-model assembly line sequencing problems in a make-to-order (MTO) environment: problem extension, model formulation and Lagrangian relaxation algorithm |
scientific article; zbMATH DE number 7319742
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Applying available-to-promise (ATP) concept in mixed-model assembly line sequencing problems in a make-to-order (MTO) environment: problem extension, model formulation and Lagrangian relaxation algorithm |
scientific article; zbMATH DE number 7319742 |
Statements
Applying available-to-promise (ATP) concept in mixed-model assembly line sequencing problems in a make-to-order (MTO) environment: problem extension, model formulation and Lagrangian relaxation algorithm (English)
0 references
11 March 2021
0 references
MMAL
0 references
sequencing
0 references
MTO
0 references
ATP
0 references
decision support system
0 references
Lagrangian relaxation algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8527618
0 references
0 references
0.84006053
0 references
0.8300023
0 references
0.8259905
0 references
0.8215031
0 references
0.8208312
0 references
0 references
