A simultaneous planning of production and scheduling operations in flexible flow shops: case study of tile industry

The aim of this paper is to study a simultaneous lot-sizing and scheduling in multi-product, multi-period flexible flow shop environments. A new mixed integer programming (MIP) model is proposed to formulate the problem. The objective function includes the total cost of production, inventory, and ex...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of advanced manufacturing technology 2017-02, Vol.88 (9-12), p.2389-2403
Hauptverfasser: Ramezanian, Reza, Fallah Sanami, Sahar, Shafiei Nikabadi, Mohsen
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The aim of this paper is to study a simultaneous lot-sizing and scheduling in multi-product, multi-period flexible flow shop environments. A new mixed integer programming (MIP) model is proposed to formulate the problem. The objective function includes the total cost of production, inventory, and external supply. In this study, in case of not meeting the demand of customers, this demand should be met by foreign suppliers in higher price. Due to the high computational complexity of the studied problem, a rolling horizon heuristic (RHH) and particle swarm optimization algorithm (PSO) are implemented to solve the problem. These algorithms find a feasible and near-optimal from production planning and scheduling. Additionally, Taguchi method is conducted to calibrate the parameters of the PSO algorithm and select the optimal levels of the influential factors. The computational results show that the algorithms are capable of achieving results with good quality in a reasonable time and PSO has better objective values in comparison with RHH. Also, the real case study for tile industry with real features is applied. Sensitivity analysis is used to evaluate the performance of the model.
ISSN:0268-3768
1433-3015
DOI:10.1007/s00170-016-8955-z