Simultaneous selection factories, assignment products to factories, lot-sizing and scheduling in distributed permutation flow shop
by Mohammad Mohammadi
International Journal of Mathematics in Operational Research (IJMOR), Vol. 12, No. 3, 2018

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.

Online publication date: Wed, 28-Mar-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com