Simultaneous lot-sizing and scheduling problem in flow shop environment with outsourcing Online publication date: Tue, 15-Nov-2016
by Mohammad Saleh Fadaki; Mehdi Bijari
International Journal of Planning and Scheduling (IJPS), Vol. 2, No. 3, 2016
Abstract: Lot-sizing and scheduling are two important issues in production planning problems. This study considers the simultaneous lot-sizing and scheduling problem in a capacitated flow shop environment with outsourcing. We propose a new exact formulation for the simultaneous lot-sizing and scheduling problem in a flow shop environment with sequence dependent setups as a mixed integer program. For demonstrating the efficiency of the proposed model, we compare it with a former model pertaining to a flow shop environment. The proposed model's efficiency is better than the former model because the number of continuous and binary variables, the number of constraints, and the solving CPU time are less than the former model. Since finding the exact solution for medium- and large-size instances is impossible within a reasonable time due to the complexity of the problem, four MIP-based rolling horizon heuristics are provided. The computational results show the effectiveness of heuristic algorithms.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Planning and Scheduling (IJPS):
Login with your Inderscience username and 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
Our Blog 
Follow us on Twitter 
Visit us on Facebook