Product processing prioritization in hybrid flow shop systems supported on Nash bargaining model and simulation-optimization
•Proposing a game-based simulation–optimization approach in HFS scheduling.•Using bargaining approach to determine the optimal priority processing rule in HFS.•Using scheduling game in an HFS exposed to the stochastic failure of machinery.•The efficiency of the approach due to the significant reduct...
Saved in:
| Published in | Expert systems with applications Vol. 180; p. 115066 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
New York
Elsevier Ltd
15.10.2021
Elsevier BV |
| Subjects | |
| Online Access | Get full text |
| ISSN | 0957-4174 1873-6793 |
| DOI | 10.1016/j.eswa.2021.115066 |
Cover
| Summary: | •Proposing a game-based simulation–optimization approach in HFS scheduling.•Using bargaining approach to determine the optimal priority processing rule in HFS.•Using scheduling game in an HFS exposed to the stochastic failure of machinery.•The efficiency of the approach due to the significant reduction of makespan.
Dynamic scheduling using real-time data in manufacturing systems enables quick response to unforeseen system events to reduce costs and makespan while increasing customer satisfaction. Since many production systems are multi-product, each product’s customers aim to receive the product in the shortest possible time, thus competing with each other. Extant research neglects to consider not only competition between customers, but also bargaining strategies. In this paper, a hybrid flow shop system with multi-product is regarded. The production system studied is the Alborz Tire Company (Iran), which uses multi-type machines subject to stochastic failure. The objective is to determine the product processing prioritization in workstations, based on the Nash bargaining model, to minimize makespan. To this end, a simulation–optimization approach based on discrete-event simulation and Simulated annealing is employed. The results of the case study show that makespan is reduced significantly for all players. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 0957-4174 1873-6793 |
| DOI: | 10.1016/j.eswa.2021.115066 |