2,307 research outputs found
An Iterated Greedy Algorithm for a Parallel Machine Scheduling Problem with Re-entrant and Group Processing Features
This research paper addresses a novel parallel machine scheduling problem with re-entrant and group processing features, specifically motivated by the hot milling process in the modern steel manufacturing industry. The objective is to minimize the makespan. As no existing literature exists on this problem, the paper begins by analyzing the key characteristics of the problem. Subsequently, a mixed integer linear programming model is formulated. To tackle the problem, an improved iterated greedy algorithm (IGA) is proposed. The IGA incorporates a problem-specific heuristic to construct the initial solution. Additionally, it incorporates an effective destruction and reconstruction procedure. Furthermore, an acceptance rule is developed to prevent the IGA from getting stuck in local optima. The proposed approach is evaluated through computational experiments. The results demonstrate that the proposed IGA outperforms three state-of-the-art meta-heuristics, highlighting its high effectiveness. Overall, this research contributes to the understanding and solution of the parallel machine scheduling problem with re-entrant and group processing features in the context of the hot milling process. The proposed algorithm provides insights for practical applications in the steel manufacturing industry
Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows
[EN] In practice due dates usually behave more like intervals rather than specific points in time. This paper studies hybrid flowshops where jobs, if completed inside a due window, are considered on time. The objective is therefore the minimization of the weighted earliness and tardiness from the due window. This objective has seldom been studied and there are almost no previous works for hybrid flowshops. We present methods based on the simple concepts of iterated greedy and iterated local search. We introduce some novel operators and characteristics, like an optimal idle time insertion procedure and a two stage local search where, in the second stage, a limited local search on a exact representation is carried out. We also present a comprehensive computational campaign, including the reimplementation and comparison of 9 competing procedures. A thorough evaluation of all methods with more than 3000 instances shows that our presented approaches yield superior results which are also demonstrated to be statistically significant. Experiments also show the contribution of the new operators in the presented methods. (C) 2016 Elsevier Ltd. All rights reserved.The authors would like to thank Professors Lofti Hidri and Mohamed Haouari for sharing with us the source codes and explanations of the lower bounds. Quan-Ke Pan is supported by the National Natural Science Foundation of China (Grant No. 51575212), Program for New Century Excellent Talents in University (Grant No. NCET-13-0106), Science Foundation of Hubei Province in China (Grant No. 2015CFB560), Specialized Research Fund for the Doctoral Program of Higher Education (Grant No. 20130042110035), Key Laboratory Basic Research Foundation of Education Department of Liaoning Province (LZ2014014), Open Research Fund Program of the State Key Laboratory of Digital Manufacturing Equipment and Technology, Huazhong University of Science and Technology, China. Ruben Ruiz and Pedro Alfaro-Fernandez are supported by the Spanish Ministry of Economy and Competitiveness, under the project "SCHEYARD Optimization of Scheduling Problems in Container Yards" (No. DPI2015-65895-R) financed by FEDER funds.Pan, Q.; Ruiz García, R.; Alfaro-Fernandez, P. (2017). Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows. Computers & Operations Research. 80:50-60. https://doi.org/10.1016/j.cor.2016.11.022S50608
Recommended from our members
An intelligent manufacturing system for heat treatment scheduling
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.This research is focused on the integration problem of process planning and scheduling in steel heat treatment operations environment using artificial intelligent techniques that are capable of dealing with such problems.
This work addresses the issues involved in developing a suitable methodology for scheduling heat treatment operations of steel. Several intelligent algorithms have been developed for these propose namely, Genetic Algorithm (GA), Sexual Genetic Algorithm (SGA), Genetic Algorithm with Chromosome differentiation (GACD), Age Genetic Algorithm (AGA), and Mimetic Genetic Algorithm (MGA). These algorithms have been employed to develop an efficient intelligent algorithm using Algorithm Portfolio methodology. After that all the algorithms have been tested on two types of scheduling benchmarks.
To apply these algorithms on heat treatment scheduling, a furnace model is developed for optimisation proposes. Furthermore, a system that is capable of selecting the optimal heat treatment regime is developed so the required metal properties can be achieved with the least energy consumption and the shortest time using Neuro-Fuzzy (NF) and Particle Swarm Optimisation (PSO) methodologies. Based on this system, PSO is used to optimise the heat treatment process by selecting different heat treatment conditions. The selected conditions are evaluated so the best selection can be identified. This work addresses the issues involved in developing a suitable methodology for developing an NF system and PSO for mechanical properties of the steel.
Using the optimisers, furnace model and heat treatment system model, the intelligent system model is developed and implemented successfully. The results of this system were exciting and the optimisers were working correctly
A hybrid genetic approach to solve real make-to-order job shop scheduling problems
Tese (doutorado) - Universidade Federal de Santa Catarina, Centro TecnologicoProcedimentos de busca local (ex. busca tabu) e algoritmos genéticos têm apresentado excelentes resultados em problemas clássicos de programação da produção em ambientes job shop. No entanto, estas abordagens apresentam pobres habilidades de modelamento e poucas aplicações com restrições de ambientes reais de produção têm sido publicadas. Além disto, os espaços de busca considerados nestas aplicações são nomlalmente incompletos e as restrições reais são poucas e dependentes do problema em questão. Este trabalho apresenta uma abordagem genética híbrida para resolver problemas de programação em ambientes job shop com grande número de restrições reais, tais como produtos com vários níveis de submontagem, planos de processamento altemativos para componentes e recursos alternativos para operações, exigência de vários recursos para executar uma operação (ex., máquina, ferramentas, operadores), calendários para todos os recursos, sobreposição de operações, restrições de disponibilidade de matéria-prima e componentes comprados de terceiros, e tempo de setup dependente da sequência de operações. A abordagem também considera funções de avaliação multiobjetivas. O sistema usa algoritmos modificados de geração de programação, que incorporam várias heurísticas de apoio à decisão, para obter um conjunto de soluções iniciais. Cada solução inicial é melhorada por um algoritmo de subida de encosta. Então, um algoritmo genético híbrido com procedimentos de busca local é aplicado ao conjunto inicial de soluções localmente ótimas. Ao utilizar técnicas de programação de alta perfomlance (heurísticas construtivas, procedimentos de busca local e algoritmos genéticos) em problemas reais de programação da produção, este trabalho reduziu o abismo existente entre a teoria e a prática da programação da produção
An improved particle swarm optimization algorithm for dynamic job shop scheduling problems with random job arrivals
The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link.Random job arrivals that happen frequently in manufacturing practice may create a need for dynamic scheduling. This paper considers an issue of how to reschedule the randomly arrived new jobs to pursue both performance and stability in a job shop. Firstly, a mixed integer programming model is established to minimize three objectives, including the discontinuity rate of new jobs during the processing, the makespan deviation of initial schedule, and the sequence deviation on machines. Secondly, four match-up strategies from references are modified to determine the rescheduling horizon. Once new jobs arrive, the rescheduling process is immediately triggered with ongoing operations remain. The ongoing operations are treated as machine unavailable constraints (MUC) in the rescheduling horizon. Then, a particle swarm optimization (PSO) algorithm with improvements is proposed to solve the dynamic job shop scheduling problem. Improvement strategies consist of a modified decoding scheme considering MUC, a population initialization approach by designing a new transformation mechanism, and a novel particle movement method by introducing position changes and a random inertia weight. Lastly, extensive experiments are conducted on several instances. The experiments results show that the modified rescheduling strategies are statistically and significantly better than the compared strategies. Moreover, comparative studies with five variants of PSO algorithm and three state-of-the-art meta-heuristics demonstrate the high performance of the improved PSO algorithm
Modeling and Solving Flow Shop Scheduling Problem Considering Worker Resource
In this paper, an uninterrupted hybrid flow scheduling problem is modeled under uncertainty conditions. Due to the uncertainty of processing time in workshops, fuzzy programming method has been used to control the parameters of processing time and preparation time. In the proposed model, there are several jobs that must be processed by machines and workers, respectively. The main purpose of the proposed model is to determine the correct sequence of operations and assign operations to each machine and each worker at each stage, so that the total completion time (Cmax) is minimized. Also this paper, fuzzy programming method is used for control unspecified parameter has been used from GAMS software to solve sample problems. The results of problem solving in small and medium dimensions show that with increasing uncertainty, the amount of processing time and consequently the completion time increases. Increases from the whole work. On the other hand, with the increase in the number of machines and workers in each stage due to the high efficiency of the machines, the completion time of all works has decreased. Innovations in this paper include uninterrupted hybrid flow storage scheduling with respect to fuzzy processing time and preparation time in addition to payment time. The allocation of workers and machines to jobs is another innovation of this article
A decentralized metaheuristic approach applied to the FMS scheduling problem
La programación de FMS ha sido uno de los temas más populares para los investigadores. Se han entregado varios enfoques para programar los FMS, incluidas las técnicas de simulación y los métodos analíticos. Las metaheurísticas descentralizadas pueden verse como una forma en que la población se divide en varias subpoblaciones, con el objetivo de reducir el tiempo de ejecución y el número de evaluaciones, debido a la separación del espacio de búsqueda. La descentralización es una ruta de investigación prominente en la programación, por lo que el costo de la computación se puede reducir y las soluciones se pueden encontrar más rápido, sin penalizar la función objetivo. En este proyecto, se propone una metaheurística descentralizada en el contexto de un problema de programación flexible del sistema de fabricación. La principal contribución de este proyecto es analizar otros tipos de división del espacio de búsqueda, particularmente aquellos asociados con el diseño físico del FMS. El desempeño del enfoque descentralizado se validará con los puntos de referencia de programación de FMS.FMS scheduling has been one of the most popular topics for researchers. A number of approaches have been delivered to schedule FMSs including simulation techniques and analytical methods. Decentralized metaheuristics can be seen as a way where the population is divided into several subpopulations, aiming to reduce the run time and the numbers of evaluation, due to the separation of the search space. Decentralization is a prominent research path in scheduling so the computing cost can be reduced and solutions can be found faster, without penalizing the objective function. In this project, a decentralized metaheuristic is proposed in the context of a flexible manufacturing system scheduling problem. The main contribution of this project is to analyze other types of search space division, particularly those associated with the physical layout of the FMS. The performance of the decentralized approach will be validated with FMS scheduling benchmarks.Ingeniero (a) IndustrialPregrad
Evolutionary methods for the design of dispatching rules for complex and dynamic scheduling problems
Three methods, based on Evolutionary Algorithms (EAs), to support and automate the design
of dispatching rules for complex and dynamic scheduling problems are proposed in this thesis.
The first method employs an EA to search for problem instances on which a given dispatching
rule performs badly. These instances can then be analysed to reveal weaknesses of the
tested rule, thereby providing guidelines for the design of a better rule. The other two methods
are hyper-heuristics, which employ an EA directly to generate effective dispatching rules. In
particular, one hyper-heuristic is based on a specific type of EA, called Genetic Programming
(GP), and generates a single rule from basic job and machine attributes, while the other generates
a set of work centre-specific rules by selecting a (potentially) different rule for each
work centre from a number of existing rules. Each of the three methods is applied to some
complex and dynamic scheduling problem(s), and the resulting dispatching rules are tested
against benchmark rules from the literature. In each case, the benchmark rules are shown to be
outperformed by a rule (set) that results from the application of the respective method, which
demonstrates the effectiveness of the proposed methods
A Pareto-Based Adaptive Variable Neighborhood Search for Biobjective Hybrid Flow Shop Scheduling Problem with Sequence-Dependent Setup Time
Different from most researches focused on the single objective hybrid flowshop scheduling (HFS) problem, this paper investigates a biobjective HFS problem with sequence dependent setup time. The two objectives are the minimization of total weighted tardiness and the total setup time. To efficiently solve this problem, a Pareto-based adaptive biobjective variable neighborhood search (PABOVNS) is developed. In the proposed PABOVNS, a solution is denoted as a sequence of all jobs and a decoding procedure is presented to obtain the corresponding complete schedule. In addition, the proposed PABOVNS has three major features that can guarantee a good balance of exploration and exploitation. First, an adaptive selection strategy of neighborhoods is proposed to automatically select the most promising neighborhood instead of the sequential selection strategy of canonical VNS. Second, a two phase multiobjective local search based on neighborhood search and path relinking is designed for each selected neighborhood. Third, an external archive with diversity maintenance is adopted to store the nondominated solutions and at the same time provide initial solutions for the local search. Computational results based on randomly generated instances show that the PABOVNS is efficient and even superior to some other powerful multiobjective algorithms in the literature
- …