Simultaneous selection factories, assignment products to factories, lot-sizing and scheduling in distributed permutation flow shop

Mohammad Mohammadi

International Journal of Mathematics in Operational Research, 2018, vol. 12, issue 3, 397-412

Abstract: 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.

Keywords: distributed permutation flow shop; lot-sizing and scheduling; sequence-dependent; assignment. (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=90811 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:12:y:2018:i:3:p:397-412

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().