Minimizing makespan in a Flow Shop Sequence Dependent Group Scheduling problem with blocking constraint
Introduction
Group Technology (GT) is a manufacturing philosophy aiming at increasing production efficiency by grouping parts and products with similar design or process requirements in order to reduce setup time and cost, simplify material flow and handling, rationalize design and standardize production processes (Ham et al., 1985). Whenever GT principles are applied in scheduling activities, a Group Scheduling (GS) problem arises. In GS problems, jobs belonging to the same group are processed sequentially with no interruption by jobs of other groups. A major setup is required on each machine when switching from one group to another, whereas setup times between jobs of the same group are usually negligible. With special reference to flow shop environments, the issue is commonly known as the Flow Shop Group Scheduling (FSGS) problem or, if setup time of groups are sequence-dependent, as the Flow Shop Sequence-Dependent Group Scheduling (FSDGS) problem.
FSGS and FSDGS problems typically arise in Cellular Manufacturing (CM) environments (Costa et al., 2014a, Costa et al., 2014b), where the shop floor is divided into smaller organizational units called manufacturing cells, each of which produces certain groups, or families, of jobs. However, such class of scheduling problems has been largely studied by literature with reference to many other practical applications, such as furniture production (Wilson et al., 2004), label sticker manufacturing (Lin and Liao, 2003), automotive paint and body shops (Salmasi et al., 2010), electronics industry (Gelogullari and Logendran, 2010).
In a comprehensive review about this topic, Neufeld et al. (2016) examined all the real-world implication of flow shop group scheduling problems, as well as the solution method proposed by the relevant literature. Metaheuristic algorithms are by far the most recurring optimization procedure for solving such a challenging issue. A pioneer metaheuristic approach was proposed by Vakharia and Chang (1990), who developed a Simulated Annealing (SA) algorithm for the FSGS problem in a manufacturing cell. Later, Skorin-Kapov and Vakharia (1993) demonstrated that a Tabu Search (TS) algorithm can reach better performances than SA for the same problem. The SA algorithm was also used by Sridhar and Rajendran (1994) to assess performances of a Genetic Algorithm (GA) specifically developed for the same problem. The comparison between TS and GA approaches was finally performed by Schaller (2000) who demonstrated as a properly adjusted Tabu Search algorithm may lead to better performance.
In order to fit the real-world industrial practice, the recent literature has been mainly focusing on flow shop group scheduling problems with sequence-dependent setup times. Franca et al. (2005) proposed a Genetic Algorithm and a Memetic Algorithm (MA) embedding a Local Search (LS) scheme for the FSDGS problem. Both algorithms used a compact representation of solutions and a hierarchically structured population where the number of possible neighbor solutions is limited by dividing the population into clusters. Bouabda et al. (2011) developed a cooperative optimization approach including a Genetic Algorithm and a Branch and Bound (BB) procedure, with the BB probabilistically integrated in the GA in order to enhance current solutions. Naderi and Salmasi (2012) formulated two different MILP models for the FSDGS problem under the total completion time minimization objective, as well as a metaheuristic procedure hybridizing GA and SA algorithms, called SGA, specifically developed for large-sized instances.
Costa et al. (2014b) developed a Mixed Integer Linear Programming (MILP) model and three GA-based metaheuristic algorithms for the FSDGS problem with skilled workforce assignment, proposing a trade-off analysis between manpower cost and makespan improvement. Nikjo and Zarook (2014) addressed a dynamic manufacturing cell scheduling problem with agreeable job release dates for each part family and setup times dependent on the sequence of part within families. The authors proposed and compared under several measures of performance two distinct approaches, namely a GA and a TS. Recently, Shahvari and Logendran (2016) addressed a bi-objective hybrid flow shop batching and scheduling problem with sequence-dependent family setup times, developing specific tabu search/path-relinking algorithms. Costa et al., 2017a, Costa et al., 2017b embedded a Biased Random Search (BRS) technique in a Genetic Algorithm to tackle the FDSGS problem under the makespan minimization objective, demonstrating the superiority of the proposed metaheuristic procedure in respect of the best performing algorithms recommended by literature. They also proved the effectiveness of their optimization procedure for the FSDGS problem with skilled workforce assignment and learning effect. Sabouni and Logendran (2018) addressed a flow-shop group scheduling problem in the assembly of Printed Circuit Boards (PCBs), proposing search algorithm and lower bounds for large-sized problems instances. Shahvari and Logendran (2018) studied a hybrid flow shop batch scheduling problem with sequence- and machine-dependent family setup times with the objective of simultaneously minimizing the weighted sum of the total weighted completion time and total weighted tardiness. They proposed robust meta-heuristics based on hybridization of local search and population-based structures along with the stage-based interdependency strategy to solve the research problem.
Despite the sizeable interest for group scheduling problems in industry, sequencing families of jobs in a flow shop environment under the blocking constraint has not received so much attention by literature, so far. To the best of our knowledge, Logendran and Sriskandarajah (1993), who studied a two-machine FSGS cellular manufacturing system, were the only one to provide a contribution to such a demanding issue. Nevertheless, blocking conditions widely exist in modern manufacturing and production environments, typically where buffer inventories are not allowed due to just-in-time strategies. When the blocking constraint is introduced in a flow shop manufacturing system, every completed job must remain on its current machine, preventing any other successive job from being processed, until the downstream machine is available (Pinedo, 2016). As shown by Martinez et al. (2006), blocking constraints are common to be encountered in manufacturing of metallic parts. In such contexts, shop floors are often arranged in cellular layouts, and therefore imply processing groups of jobs. Such consideration motivates the present research, which addresses the problem of minimizing makespan in an M machines flow shop sequence dependent group scheduling problem with blocking constraint.
This paper aims to investigate the Flow Shop Sequence-Dependent Group Scheduling problem with blocking constraint through a novel Self-Calibrating Genetic Algorithm (PSAGA). The main feature of the proposed algorithm consists of its ability in changing the genetic parameters according to an evolutionary scheme, which allows achieving a proper balance between exploration and exploitation, thus avoiding any time-consuming calibration analysis. In fact, besides the advantage in terms of quality of solutions, a relevant characteristic of the developed PSAGA lies in the fact that no preliminary tuning phase is needed, thus ensuring a fast and effective implementation.
The remainder of the paper is organized as follows. Section 2 provides a description of the FSDGS problem under blocking constraint. Section 3 illustrates the structure and the main operators of the proposed PSAGA. In Section 4, test problem instances and obtained results are shown. Finally, Section 5 concludes the paper.
Section snippets
Problem description
The proposed FSDGS problem can be stated as follows. A flow-shop system made by M machines (,2,…M) has to process G groups of jobs (,2,…, G). Each group g holds jobs and is the processing time of job j of group g on machine m. Thus, the total number of jobs to be processed is equal to N =. Setup times of groups are sequence dependent, i.e., a major setup is needed on each machine when switching from one group to another; thus, is the setup time required on machine m by
The proposed parallel self-adaptive genetic algorithm (PSAGA)
According with Logendran and Sriskandarajah (1993), the flow shop group scheduling problem is NP-hard in the strong sense even in the case of only two machines, sequence-independent setup times and no blocking constraint. Therefore, it can be asserted the problem under investigation is NP-hard in the strong sense, as well. In order to cope with such computational complexity, a metaheuristic algorithm is required to reach effective solutions within a reasonable time.
The optimization procedure
Comparison between PSAGA and tuned GA
The most relevant feature of the proposed PSAGA consists in the self-regulating selection of the genetic parameters. As a matter of fact, this allows avoiding any time-consuming preliminary tuning analysis and makes the algorithm ready for the optimization issue at hand. In order to test the effectiveness of the proposed self-calibrating algorithm a Genetic Algorithm featured by the same encoding scheme and the same evolutionary strategy of PSAGA has been taken as a reference. Parameters p1cr,
Conclusions
In this paper, the flow shop sequence-dependent group scheduling problem with blocking constraint is addressed. In spite of its practical relevance, such a challenging problem was not tackled by literature so far. In order to minimize the makespan, a novel Parallel Self-Adaptive Genetic Algorithm (PSAGA) has been devised. The proposed optimization procedure basically consists of multiple Genetic Algorithms nested in an upper-level evolutionary strategy that drives the search modulating the
Acknowledgment
This work has been financed by the University of Catania within the project “Piano della Ricerca Dipartimentale 2016-2018” of the DICAR Department.
References (34)
- et al.
A hybrid genetic-ant colony optimization algorithm for the word sense disambiguation problem
Inform. Sci.
(2017) - et al.
A branch and bound enhanced genetic algorithm for scheduling a flowline manufacturing cell with sequence dependent family setup times
Comput. Oper. Res.
(2011) - et al.
Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups
Comput. Ind. Eng.
(2005) - et al.
Hybrid fuzzy clustering methods based on improved self-adaptive cellular genetic algorithm and optimal-selection-based fuzzy c-means
Neurocomputing
(2017) - et al.
A case study in a two-stage hybrid flow shop with setup time and dedicated machines
Int. J. Prod. Econ.
(2003) - et al.
Two-machine group scheduling problem with blocking and anticipatory setups
European J. Oper. Res.
(1993) - et al.
A self-adaptive genetic algorithm to estimate JA model parameters considering minor loops
J. Magn. Magn. Mater.
(2015) - et al.
Designing customer-oriented catalogs in e-CRM using an effective self-adaptive genetic algorithm
Expert Syst. Appl.
(2011) - et al.
Complexity of flowshop scheduling problems with a new blocking constraint
European J. Oper. Res.
(2006) - et al.
A comprehensive review of flowshop group scheduling literature
Comput. Oper. Res.
(2016)
Total flow time minimization in a flowshop sequence-dependent group scheduling problem
Comput. Oper. Res.
Three self-adaptive multi-objective evolutionary algorithms for a triple-objective project scheduling problem
Comput. Ind. Eng.
Hybrid flow shop batching and scheduling with a bi-criteria objective
Int. J. Prod. Econ.
A comparison of two stage-based hybrid algorithms for a batch scheduling problem in hybrid flow shop with learning effect
Int. J. Prod. Econ.
A genetic algorithm for family and job scheduling in a flowline-based manufacturing cell
Comput. Ind. Eng.
Optimal reactive power dispatch using self-adaptive real coded genetic algorithm
Electr. Power Syst. Res.
Enhancement of Self-adaptive real-coded genetic algorithm using Taguchi method for Economic dispatch problem
Appl. Soft Comput.
Cited by (30)
Multi-population cooperative multi-objective evolutionary algorithm for sequence-dependent group flow shop with consistent sublots
2024, Expert Systems with ApplicationsAn effective two-stage iterated greedy algorithm for distributed flowshop group scheduling problem with setup time
2023, Expert Systems with ApplicationsA multi-objective optimization algorithm for flow shop group scheduling problem with sequence dependent setup time and worker learning
2023, Expert Systems with ApplicationsRedefining hybrid flow shop group scheduling: Unveiling a novel hybrid modeling paradigm and assessing 48 MILP and CP models
2023, Swarm and Evolutionary ComputationAn asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem
2023, European Journal of Operational ResearchProblem-specific knowledge MOEA/D for energy-efficient scheduling of distributed permutation flow shop in heterogeneous factories
2023, Engineering Applications of Artificial Intelligence