Abstract
This paper deals with the problem of scheduling operations in cellular manufacturing systems. A concurrent approach is proposed for job shop cell scheduling while the objective is to minimize the makespan. An integer linear programming model is developed by considering exceptional elements, intercellular moves, intercellular transportation times, and sequence-dependent family setup times. A modification of the model with reduced number of functional constraints is then presented to enhance the efficiency of the model in terms of computational time. In order to efficiently solve real-size problems in a reasonable amount of time, a heuristic approach based on the genetic algorithm (GA) is also developed. The proposed GA is enhanced with problem-specific knowledge of the search space by using a specialized repair strategy, a decoding procedure based on the concept of active schedules and a problem-specific mutation operator which prevents the algorithm from searching redundant solutions. Results reveal that the modified mixed integer linear programming model significantly reduces the computational time and the proposed GA is capable of providing promising solutions to large-scale problems.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
Arkat J, Farahani MH, Ahmadizar F (2012) Multi-objective genetic algorithm for cell formation problem considering cellular layout and operations scheduling. Int J Comput Integr Manuf 25(7):625–635
Behnamian J, Zandieh M, Fatemi Ghomi SMT (2010) Due windows group scheduling using an effective hybrid optimization approach. Int J Adv Manuf Technol 46:721–735
Celano G, Costa A, Fichera S (2010) Constrained scheduling of the inspection activities on semiconductor wafers grouped in families with sequence-dependent set-up times. Int J Adv Manuf Technol 46:695–705
Chen YC, Lee CE (2001) A bottleneck-based group scheduling procedure for job-shop cells. J Chin Inst Ind Eng 18(5):1–12
Elmi A, Solimanpour M, Topaloglu S, Elmi A (2011) A simulated annealing algorithm for the job shop cell scheduling problem with intercellular moves and reentrant parts. Comput Ind Eng 61:171–178
França PM, Gupta JN, Mendes AS, Moscato P, Veltink KJ (2005) Evolutionary algorithms for scheduling a flow shop manufacturing cell with sequence dependent family setups. Comput Ind Eng 48(3):491–506
Frazier GV (1996) An evaluation of group scheduling heuristics in a flow-line manufacturing cell. Int J Prod Res 34(4):959–976
Hamed Hendizadeh S, Faramarzi H, Mansouri SA, Gupta JN, ElMekkawy T (2008) Meta-heuristics for scheduling a flowline manufacturing cell with sequence dependent family setup times. Int J Prod Econ 111(2):593–605
Haupt RL, Haupt SE (2004) Practical genetic algorithms. 2nd edition, Wiley
Hitomi K, Ham I (1976) Operations scheduling for group technology applications. Annals CIRP 25(1):419–422
Karimi N, Zandieh M, Karamooz HR (2010) Bi-objective group scheduling in hybrid flexible flowshop: a multi-phase approach. Expert Syst Appl 37:4024–4032
Lin SW, Ying KC, Lee ZJ (2009) Metaheuristics for scheduling a non-permutation flowline manufacturing cell with sequence dependent family setup times. Comput Oper Res 36(4):1110–1121
Mahmoodi F, Dooley KJ (1991) A comparison of exhaustive and non-exhaustive group scheduling heuristics in a manufacturing cell. Int J Prod Res 29(9):1923–1939
Mahmoodi F, Martin GE (1997) A new shop-based and predictive scheduling heuristic for cellular manufacturing. Int J Prod Res 35(2):313–326
Mahmoodi F, Dooley KJ, Starr PJ (1990) An investigation of dynamic group scheduling heuristics in a job shop manufacturing cell. Int J Prod Res 28(9):1695–1711
Naderi B, Fatemi Ghomi SMT, Aminnayeri M, Zandieh M (2010) A contribution and new heuristics for open shop scheduling. Comput Oper Res 37:213–221
Paydar MM, Saidi-Mehrabad M, Kia R (2013) Designing a new integrated model for dynamic cellular manufacturing systems with production planning and intra-cell layout. Int J Appl Deci Sci 6(2):117–143
Pinedo M (2002) Scheduling: theory, algorithms, and systems. Prentice Hall, New Jersey
Reddy V, Narendran TT (2003) Heuristics for scheduling sequence-dependent set-up jobs in flow line cells. Int J Prod Res 41(1):193–206
Renna P, Ambrico M (2014) Design and reconfiguration models for dynamic cellular manufacturing to handle market changes. Int J Comput Integr Manuf. doi:10.1080/0951192X.2013.874590
Ruben RA, Mosier CT, Mahmoodi F (1993) A comprehensive analysis of group scheduling heuristics in a job shop cell. Int J Prod Res 31(6):1343–1369
Salmasi N, Logendran R, Skandari MR (2010) Total flow time minimization in a flowshop sequence-dependent group scheduling problem. Comput Oper Res 37:199–212
Schaller J (2000) A comparison of heuristics for family and job scheduling in a flow-line manufacturing cell. Int J Prod Res 38(2):287–308
Schmidt CW, Grossmann IE, Blau GE (1998) Optimization of industrial scale scheduling problems in new product development. Comput Chem Eng 22:1027–1030
Shankar R, Vrat P (1998) Post design modeling for cellular manufacturing system with cost uncertainty. Int J Prod Econ 55(1):97–109
Skorin-Kapov A, Vakharia J (1993) Scheduling a flow-line manufacturing cell: a tabu search approach. Int J Prod Res 31(7):1721–1734
Solimanpur M, Elmi A (2013) A tabu search approach for cell scheduling problem with makespan criterion. Int J Prod Econ 141:639–645
Sridhar J, Rajendran C (1993) Scheduling in a cellular manufacturing system: a simulated annealing approach. Int J Prod Res 31(12):2927–2945
Sridhar J, Rajendran C (1996) Scheduling in flowshop and cellular manufacturing systems with multiple objectives—a genetic algorithm approach. Prod Plan Control 7(4):374–382
Tavakkoli-Moghaddam R, Javadian N, Khorrami A, Gholipour-Kanani Y (2010) Design of a scatter search method for a novel multi-criteria group scheduling problem in a cellular manufacturing system. Expert Syst Appl 37:2661–2669
Wemmerlov U, Hyer NL (1986) Procedures for the part family, machine group identification problem in cellular manufacturing. J Oper Manag 6(2):125–147
Zandieh M, Dorri B, Khamseh AR (2009) Robust metaheuristics for group scheduling with sequence-dependent setup times in hybrid flexible flow shops. Int J Adv Manuf Technol 43:767–778
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Halat, K., Bashirzadeh, R. Concurrent scheduling of manufacturing cells considering sequence-dependent family setup times and intercellular transportation times. Int J Adv Manuf Technol 77, 1907–1915 (2015). https://doi.org/10.1007/s00170-014-6511-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-014-6511-2