- Research Article
75
- 10.1016/j.rcim.2007.01.001
Lot streaming for product assembly in job shop environment
- Mar 12, 2007
- Robotics and Computer-Integrated Manufacturing
- F.T.S Chan + 2 more +2
Lot streaming for product assembly in job shop environment
The classical job-shop scheduling problems (JSP) become assembly job-shop scheduling problems (AJSP) if assembly constraints are attached to them. The entire solution space size and the feasible one of AJSP are analyzed and obtained by utilizing combinational mathematics. It is proved that the feasible solution space takes extremely small portion of the entire one. To minimize the makespan of AJSP, genetic algorithm searching in feasible solution space (FGA) is proposed and designed, and the search range of FGA is limited to feasible solution space. Finally, benchmarks tests and results are given which demonstrate the advantage and efficiency of FGA.
Lot streaming for product assembly in job shop environment
Lot streaming for product assembly in job shop environment
Analysis of double-resource flexible job shop scheduling problem based on genetic algorithm
The classic job shop scheduling problem mainly focuses on one kind of manufacturing resources, such as machine tools, and etc. But the job shop scheduling in practical production activities always needs to consider the constraints of different manufacturing resources. In this paper, a double-resource flexible job shop scheduling problem (DFJSSP) is presented. Both machines and workers are considered in the process of job shop scheduling in this DFJSSP. And a genetic algorithm (GA) is used to solve this problem, in which a new well designed three-layer chromosome encoding method has been adopted and some effective crossover and mutation operators are designed. Finally, a case study is used to validate the method.
Read moreAn extended flexible job shop scheduling problem with parallel operations
Traditional planning and scheduling techniques still hold important roles in modern smart scheduling systems. Realistic features present in modern manufacturing systems need to be incorporated into these techniques. Flexible job-shop scheduling problem (FJSP) is one of the most challenging combinatorial optimization problems. FJSP is an extension of the classical job shop scheduling problem where an operation can be processed by several different machines. In this paper, we consider the FJSP with parallel operations (EFJSP) and we propose and compare a discrete firefly algorithm (FA) and a genetic algorithm (GA) for the problem. Several FJSP and EFJSP instances were used to evaluate the performance of the proposed algorithms. Comparisons among our methods and state-of-the-art algorithms are also provided. The experimental results demonstrate that the FA and GA achieved improvements in terms of efficiency and efficacy. Solutions obtained by both algorithms are comparable to those obtained by algorithms with local search. In addition, based on our initial experiments, results show that the proposed discrete firefly algorithm is feasible, more effective and efficient than our proposed genetic algorithm for the considered problem.
Read moreA Novel Artificial Immune Algorithm for Job Shop Scheduling
The job shop scheduling problem (JSSP) is one of the most difficult problems, as it is classified as an NP-complete one. In this paper, by integrating chaos mechanism and niche technique, a novel artificial immune algorithm based on the clonal selection principle and idiotypic immune network theory exhibited in biological immune system is proposed to solve classical job shop scheduling problem. Taking advantages of the ergodic and stochastic properties of chaotic variable, an adaptive chaos mutation operator is designed by the combination of prior knowledge of antibody and evolution iterations. The operator can avoid blind search and enhance the convergence speed effectively. Experimental results indicate that the proposed algorithm is highly competitive, being able to produce better solutions than GA and CLONALG in several cases, and is a viable alternative for solving efficiently job shop scheduling problem.
Read moreCooperative Ant Colony Algorithm for Flexible Manufacturing Systems
An ant colony optimization algorithm that accounts for the special requirements of Flexible Manufacturing Systems (FMS) is presented in this paper. The scheduling problem of FMS is conceived as a classical job shop scheduling problem (JSSP). The objective is to minimize the time taken for all jobs to finish execution (i.e. the makespan). The proposed algorithm accounts for the dynamicity of the FMS environment and automates the schedule update by incorporating newly arrived jobs to the existing schedule. The Ant Colony algorithm is applied to solve different discrete optimization problems by artificial ants, using indirect communication to make all routing decisions by reacting to their dynamically changing environment through cooperation between ants and updating their pheromone trails. The effectiveness of the algorithm proposed in this paper is investigated by examining numerical results, and the computational experiments have been executed based on the JSSP data benchmarks.
Read moreRecent Bio-inspired Algorithms for Solving Flexible Job Shop Scheduling Problem: A Comparative Study
Flexible job shop scheduling problem (FJSP) is an extended formulation of the classical job shop scheduling problem, endowing great significance in the modern manufacturing system. The FJSP defines an operation that can be processed by any machine from a given set, which is a strong constrained NP-hard problem and intractable to be solved. In this paper, three recent proposed meta-heuristic optimization algorithms have been employed in solving the FJSP aiming to minimize the makespan, including moth-flame optimization (MFO), teaching-learning-based optimization (TLBO) and Rao-2 algorithm. Two featured FJSP cases are carried out and compared to evaluate the effectiveness and efficiency of the three algorithms, also associated with other classical algorithm counterparts. Numerical studies results demonstrate that the three algorithms can achieve significant improvement for solving FJSP, and MFO method appears to be the most competitive solver for the given cases.
Read moreA genetic-operator-integrated whale optimization algorithm for solving the flexible job shop scheduling problem
With the growing emphasis on intelligent and sustainable manufacturing, the flexible job shop scheduling problem (FJSP) has emerged as a critical optimization challenge due to its capability to model complex and dynamic production environments. As an NP-hard problem, FJSP poses significantly greater complexity than the classical job shop scheduling problem, particularly in high-precision domains such as aerospace manufacturing, where traditional optimization methods often fall short. To overcome the limitations of the standard Whale Optimization Algorithm (WOA)–namely its continuous search paradigm and inadequate local search mechanisms–this paper proposes a genetic-operator-integrated whale optimization algorithm (GOI-WOA) tailored for discrete scheduling tasks. The GOI-WOA employs a two-layer discrete encoding strategy to represent operations and machine assignments, and introduces genetic operators, a critical-path-based neighborhood search, and a temporal-entropy-based local search to enhance solution diversity and local exploitation. Furthermore, an elite information-sharing mechanism is incorporated to facilitate the diffusion of high-quality solutions within the population. Comprehensive experiments conducted on standard benchmark instances demonstrate that GOI-WOA consistently outperforms baseline WOA and other state-of-the-art methods in terms of makespan minimization, convergence stability, and computational efficiency. These results validate the effectiveness and robustness of GOI-WOA as a competitive solution framework for complex manufacturing scheduling problems.
Read moreA modified shifting bottleneck heuristic for the reentrant job shop scheduling problem with makespan minimization
This paper proposes a modified shifting bottleneck heuristic (MSBH) for the reentrant job shop scheduling problem (RJSSP) with makespan minimization objective. Recently, the reentrant job shop has come into prominence as a new type of manufacturing shop. The principle characteristic of a reentrant job shop is that a job may visit certain machines more than once during the process flow, whereas in the classic job shop, each job visits a machine only once. The shifting bottleneck heuristic (SBH) is one of the most successful heuristic approaches for the classical job shop scheduling problem, which decomposes the problem into a number of single-machine subproblems. This paper adapts the SBH for the RJSSP and proposes a new sequencing heuristic for the single-machine maximum lateness subproblem considering the reentrant jobs in order to handle large-size RJSSPs. It also uses a subproblem criticality measure that further shortens the implementation time. The proposed MSBH is tested by using instances up to 20 machines and 100 jobs, and it is illustrated that good quality solutions can be obtained in reasonable computational times. A real-life application of the MSBH is also given as a case study to evaluate its performance.
Read moreAnt colony optimization combined with taboo search for the job shop scheduling problem
Ant colony optimization combined with taboo search for the job shop scheduling problem
Application of Levy flight-based harmony search algorithm for the flexible job shop scheduling
The Flexible Job Shop Scheduling Problem (FJSP) is an extension of the classical job shop scheduling problem, which is characterized by the fact that each process can be processed on multiple candidate machines, and needs to solve the two subproblems of machine allocation and process sequencing simultaneously. Since FJSP is an NP-hard problem, its complexity and multi-objective characteristics make the traditional exact methods inefficient. At the same time, the existing intelligent optimization algorithms are prone to falling into local optimums, which makes it difficult to balance global exploration and local exploitation capabilities. To this end, this study proposed a Levy flight-based Harmony Search algorithm (LHS), which effectively avoids premature convergence by dynamically and adaptively adjusting the Harmony Memory Considering Rate (HMCR), the probability of Pitch Adjusting Rate (PAR), and the arbitrary distance Bandwidth(BW), and by introducing a Levy flight mechanism to perturb the parameters to broaden the search space and enhance the diversity of the population. We validate the experiments using 8 × 8, 10 × 10, and 10 benchmark instances proposed by Brandimarte in the literature, and the experimental results show that the Harmony search algorithm based on Levy flight outperforms the other comparative algorithms in terms of the solution quality and the convergence speed, demonstrating the effectiveness of its solution for FJSP.
Read moreFlexible Job Shop Scheduling Problem Using an Improved Ant Colony Optimization
As an extension of the classical job shop scheduling problem, the flexible job shop scheduling problem (FJSP) plays an important role in real production systems. In FJSP, an operation is allowed to be processed on more than one alternative machine. It has been proven to be a strongly NP-hard problem. Ant colony optimization (ACO) has been proven to be an efficient approach for dealing with FJSP. However, the basic ACO has two main disadvantages including low computational efficiency and local optimum. In order to overcome these two disadvantages, an improved ant colony optimization (IACO) is proposed to optimize the makespan for FJSP. The following aspects are done on our improved ant colony optimization algorithm: select machine rule problems, initialize uniform distributed mechanism for ants, change pheromone’s guiding mechanism, select node method, and update pheromone’s mechanism. An actual production instance and two sets of well-known benchmark instances are tested and comparisons with some other approaches verify the effectiveness of the proposed IACO. The results reveal that our proposed IACO can provide better solution in a reasonable computational time.
Read moreClassification and Feasibility Assessment of Infinitely Many Iso-Impulse Three-Dimensional Trajectories
In two-body dynamics, it is proven that for a sufficiently long flight time, generating infinitely many iso-impulse solutions is possible by solving a number of $$\Delta v$$ -allocation problems analytically. A distinct feature of these iso-impulse solutions is the existence of two impulse anchor positions (APs) that correspond to the locations of the impulses on time-free, phase-free, base solutions. In this paper, the existence and utility of three-impulse base solutions are investigated and their complete solution spaces are characterized and analyzed. Since two- and three-impulse base solutions exist, a question arises: How many APs should base solutions have? A strategy is developed for choosing base solutions, which offers a certificate for $$\Delta v$$ optimality of general three-dimensional time-fixed rendezvous solutions. Simultaneous allocation of $$\Delta v$$ at two and three APs is formulated, which allows for generating $$\Delta v$$ -optimal solutions while satisfying a constraint on individual impulses such that $$\Delta v \le \Delta v_\text {max}$$ . A key result is that all iso-impulse solutions can be classified into four layers: 1) base solutions, 2) feasible solution spaces, 3) solution families, and 4) solution envelopes. The method enables us to characterize the complete solution space of minimum- $$\Delta v$$ , iso-impulse, and three-dimensional trajectories under nonlinear two-body dynamics. To illustrate the utility of the method, geocentric examples are considered including the apogee-raising phase of the CAPSTONE mission subject to an operational constraint on the maximum magnitude of the individual impulses.
Read moreTraining of Multi-Branch Neural Networks using RasID-GA
This paper applies a adaptive random search with intensification and diversification combined with genetic algorithm (RasID-GA) to neural network training. In the previous work, we proposed RasID-GA which combines the best properties of RasID and Genetic Algorithm for optimization. Neural networks are widely used in pattern recognition, system modeling, prediction and other areas. Although most neural network training uses gradient based schemes such as well- known back-propagation (BP), but sometimes BP is easily dropped into local minima. In this paper, we train multi-branch neural networks using RasID-GA with constraint coefficient C by which the feasible solution space is controlled. In addition, we use Mackey-Glass time prediction to test a generalization ability of the proposed method.
Read moreA market-based method for reconfiguration of distribution network
A market-based method for reconfiguration of distribution network
An improved particle swarm optimization algorithm for unit commitment
An improved particle swarm optimization algorithm for unit commitment