Modeling and Scheduling of Multi-Stage and Multi-Processor Flow Shop
Keywords:
multi-processor flow shop scheduling, critical ratio, processing complexity, completion time, set up time, mean time between maintenance
Abstract
This paper addresses a multi-stage and multi-processor flow shop scheduling problem while minimizing the over utilization of machines. Fuzzy Inference System has been used to determine the job priority, considering factors such as completion times, processing complexity, critical ratio, profit over time, cost over time and level of inventory, while incorporating their uncertainties. In a similar manner, machine priority has been deduced, taking into account the mean time between failure, mean time to repair, mean time between shutdown, mean time between maintenance, failure rate and set up time. The grouping and sequencing of jobs in every stage are determined by an algorithm in such a way that the problem becomes multiobjective with objectives like minimizing the lead time, set up time, level of inventory, while maximizing machine and labor utilization along with profit over time.
Downloads
- Article PDF
- TEI XML Kaleidoscope (download in zip)* (Beta by AI)
- Lens* NISO JATS XML (Beta by AI)
- HTML Kaleidoscope* (Beta by AI)
- DBK XML Kaleidoscope (download in zip)* (Beta by AI)
- LaTeX pdf Kaleidoscope* (Beta by AI)
- EPUB Kaleidoscope* (Beta by AI)
- MD Kaleidoscope* (Beta by AI)
- FO Kaleidoscope* (Beta by AI)
- BIB Kaleidoscope* (Beta by AI)
- LaTeX Kaleidoscope* (Beta by AI)
How to Cite
References
J Behnamian, S Fatemi Ghomi (2011) Hybrid flowshop scheduling with machine and resource-dependent processing times. 35(3), 1107-1123.
J Behnamian, M Zandieh (2011) A discrete colonial competitive algorithm for hybrid flowshop scheduling to minimize earliness and quadratic tardiness penalties. 38(12), 14490-14498.
A Benavides, M Ritt, C Miralles (2014) Flow shop scheduling with heterogeneous workers. 237(2), 713-720.
W Bożejko, J Pempera, C Smutnicki (2013) Parallel tabu search algorithm for the hybrid flow shop problem. 65(3), 466-474.
Felix Chan, Afshin Kazerooni, Kazem Abhary (1997) A fuzzy approach to operation selection. 10(4), 345-356.
J Chen, J Pan, C Lin (2009) Solving the reentrant permutation flow-shop scheduling problem with a hybrid genetic algorithm. 16(1), 23-31.
J Cheng, G Steiner, P Stephenson (2001) A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times. 130(3), 559-575.
Fuh-Der Chou (2013) Particle swarm optimization with cocktail decoding method for hybrid flow shop scheduling problems with multiprocessor tasks. 141(1), 137-145.
V Galzina, R Luji Ć, T &šarić (2012) ADAPTIVE FUZZY PARTICLE SWARM OPTIMIZATION FOR FLOW-SHOP SCHEDULING PROBLEM. 19(1).
B Grabot, L Geneste (1994) Dispatching rules in scheduling Dispatching rules in scheduling: a fuzzy approach. 32(4), 903-915.
W Gu, X Li, L Zhu, J Zhou, Y Hu (2010) A gravitational search algorithm for flow shop scheduling. 5(5), 411-418.
J Gupta, K Hennig, F Werner (2002) Local search heuristics for two-stage flow shop problems with secondary criterion. 29(2), 123-149.
Tzung-Pei Hong, Tzu-Tin Wang (2000) Fuzzy flexible flow shops at two machine centers for continuous fuzzy domains. 129(1-4), 227-237.
Hisao Ishibuchi, Naohisa Yamamoto, Shinta Misaki, Hideo Tanaka (1994) Local search algorithms for flow shop scheduling with fuzzy due-dates. 33(1-3), 53-66.
I Kacem, S Hammadi, P Borne (2002) Paretooptimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic. 60(3), 245-276.
K Keung, W Ip, D Yuen (2003) An intelligent hierarchical workstation control model for FMS. 139(1), 134-139.
Safa Khalouli, Fatima Ghedjati, Abdelaziz Hamzaoui (2010) A meta-heuristic approach to solve a JIT scheduling problem in hybrid flow shop. 23(5), 765-771.
Deming Lei (2010) Fuzzy job shop scheduling problem with availability constraints. 58(4), 610-617.
M Marichelvam, T Prabaharan, X Yang (2014) Improved cuckoo search algorithm for hybrid flow shop scheduling problems to minimize makespan. 19, 93-101.
C Mccahon, E Lee (1992) Fuzzy job sequencing for a flow shop. 62(3), 294-301.
N Moradinasab, R Shafaei, M Rabiee, P Ramezani (2013) No-wait two stage hybrid flow shop scheduling with genetic and adaptive imperialist competitive algorithms. 25(2), 207-225.
A Mozdgir, S Fatemi Ghomi, F Jolai, J Navaei (2013) Two-stage assembly flow-shop scheduling problem with non-identical assembly machines considering setup times. 51(12), 3625-3642.
Mahdi Naderi-Beni, Reza Tavakkoli-Moghaddam, Bahman Naderi, Ehsan Ghobadian, Alireza Pourrousta (2012) A two-phase fuzzy programming model for a complex bi-objective no-wait flow shop scheduling. 3(4), 617-626.
S Paul, A Azeem (2010) Minimization of work in process inventory in hybrid flow shop scheduling using fuzzy logic. 17(2).
Alberto Petroni, Antonio Rizzi (2002) A fuzzy logic based methodology to rank shop floor dispatching rules. 76(1), 99-108.
M Rabiee, M Zandieh, A Jafarian (2012) Scheduling of a no-wait two-machine flow shop with sequence-dependent setup times and probable rework using robust metaheuristics. 50(24), 7428-7446.
T Ramanan, R Sridharan, K Shashikant, A (2011) An artificial neural network based heuristic for flow shop scheduling problems. 22(2), 279-288.
R Ruiz, J Vázquez-Rodríguez (2010) The hybrid flow shop scheduling problem. 205(1), 1-18.
R Shafaei, M Rabiee, M Mirzaeyan (2011) An adaptive neuro fuzzy inference system for makespan estimation in multiprocessor no-wait two stage flow shop. 24(10), 888-899.
Yasuhiro Tsujimura, Seung Park, In Chang, Mitsuo Gen (1993) An effective method for solving flow shop scheduling problems with fuzzy processing times. 25(1-4), 239-242.
Shijin Wang, Ming Liu (2013) A genetic algorithm for two-stage no-wait hybrid flow shop scheduling problem. 40(4), 1064-1075.
Y Yun (2002) Genetic algorithm with fuzzy logic controller for preemptive and non-preemptive job.
Published
2017-01-17
Issue
Section
License
Copyright (c) 2016 Authors and Global Journals Private Limited

This work is licensed under a Creative Commons Attribution 4.0 International License.