Simultaneous selection factories, assignment products to factories, lot-sizing and scheduling in distributed permutation flow shop (Q2204602)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7261715
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simultaneous selection factories, assignment products to factories, lot-sizing and scheduling in distributed permutation flow shop |
scientific article; zbMATH DE number 7261715 |
Statements
Simultaneous selection factories, assignment products to factories, lot-sizing and scheduling in distributed permutation flow shop (English)
0 references
15 October 2020
0 references
Summary: The simultaneous selection factory's problem has been recently proposed as a generalisation in distributed permutation flow shop setting. In this paper, a new generalisation of simultaneous lot-sizing and scheduling decisions in permutation flow shop problem to the distributed permutation flow shop has been studied. Under this generalisation, it is not necessary to use all existing factories and each product cannot be produced in more than one factory. An exact formulation of the problem provided as a mixed integer program. In order to solve the problem, a heuristic procedure has been developed. To test the accuracy of heuristic, a lower bound is developed and compared against the optimal solution.
0 references
distributed permutation flow shop
0 references
lot-sizing and scheduling
0 references
sequence-dependent
0 references
assignment
0 references
0.8330819010734558
0 references
0.7934324145317078
0 references
0.7804016470909119
0 references
0.7607493996620178
0 references
0.7593827843666077
0 references
