66 research outputs found
Iterated-greedy-based algorithms with beam search initialization for the permutation flowshop to minimize total tardiness
The permutation flow shop scheduling problem is one of the most studied operations research related problems. Literally, hundreds of exact and approximate algorithms have been proposed to optimise several objective functions. In this paper we address the total tardiness criterion, which is aimed towards the satisfaction of customers in a make-to-order scenario. Although several approximate algorithms have been proposed for this problem in the literature, recent contributions for related problems suggest that there is room for improving the current available algorithms. Thus, our contribution is twofold: First, we propose a fast beam-search-based constructive heuristic that estimates the quality of partial sequences without a complete evaluation of their objective function. Second, using this constructive heuristic as initial solution, eight variations of an iterated-greedy-based algorithm are proposed. A comprehensive computational evaluation is performed to establish the efficiency of our proposals against the existing heuristics and metaheuristics for the problem.Ministerio de Ciencia e Innovación DPI2013-44461-PMinisterio de Ciencia e Innovación DPI2016-80750-
A computational evaluation of constructive and improvement heuristics for the blocking flow shop to minimize total flowtime
This paper focuses on the blocking flow shop scheduling problem with the objective of total flowtime minimisation. This problem assumes that there are no buffers between machines and, due to its application to many manufacturing sectors, it is receiving a growing attention by researchers during the last years. Since the problem is NP-hard, a large number of heuristics have been proposed to provide good solutions with reasonable computational times. In this paper, we conduct a comprehensive evaluation of the available heuristics for the problem and for related problems, resulting in the implementation and testing of a total of 35 heuristics. Furthermore, we propose an efficient constructive heuristic which successfully combines a pool of partial sequences in parallel, using a beam-search-based approach. The computational experiments show the excellent performance of the proposed heuristic as compared to the best-so-far algorithms for the problem, both in terms of quality of the solutions and of computational requirements. In fact, despite being a relative fast constructive heuristic, new best upper bounds have been found for more than 27% of Taillard’s instances.Ministerio de Ciencia e Innovación DPI2013-44461-P/DP
A beam-search-based constructive heuristic for the PFSP to minimise total flowtime
In this paper we present a beam-search-based constructive heuristic to solve the
permutation flowshop scheduling problem with total flowtime minimisation as objective. This well-known problem is NP-hard, and several heuristics have been developed
in the literature. The proposed algorithm is inspired in the logic of the beam search,
although it remains a fast constructive heuristic.
The results obtained by the proposed algorithm outperform those obtained by
other constructive heuristics in the literature for the problem, thus modifying substantially the state-of-the-art of efficient approximate procedures for the problem. In
addition, the proposed algorithm even outperforms two of the best metaheuristics for
many instances of the problem, using much lesser computation effort. The excellent
performance of the proposal is also proved by the fact that the new heuristic found
new best upper bounds for 35 of the 120 instances in Taillard’s benchmark.Ministerio de Ciencia e Innovación DPI2013-44461-PMinisterio de Ciencia e Innovación DPI2016-80750-
An effective iterated greedy algorithm for the mixed no-idle flowshop scheduling problem
In the no-idle flowshop, machines cannot be idle after finishing one job and before starting the next one.
Therefore, start times of jobs must be delayed to guarantee this constraint. In practice machines show
this behavior as it might be technically unfeasible or uneconomical to stop a machine in between jobs.
This has important ramifications in the modern industry including fiber glass processing, foundries,
production of integrated circuits and the steel making industry, among others. However, to assume that
all machines in the shop have this no-idle constraint is not realistic. To the best of our knowledge, this is
the first paper to study the mixed no-idle extension where only some machines have the no-idle
constraint. We present a mixed integer programming model for this new problem and the equations to
calculate the makespan. We also propose a set of formulas to accelerate the calculation of insertions that
is used both in heuristics as well as in the local search procedures. An effective iterated greedy (IG)
algorithm is proposed. We use an NEH-based heuristic to construct a high quality initial solution. A local
search using the proposed accelerations is employed to emphasize intensification and exploration in the
IG. A new destruction and construction procedure is also shown. To evaluate the proposed algorithm, we
present several adaptations of other well-known and recent metaheuristics for the problem and conduct
a comprehensive set of computational and statistical experiments with a total of 1750 instances.
The results show that the proposed IG algorithm outperforms existing methods in the no-idle and in the
mixed no-idle scenarios by a significant margin.Quan-Ke Pan is partially supported by the National Science Foundation of China 61174187, Program for New Century Excellent Talents in University (NCET-13-0106), Science Foundation of Liaoning Province in China (2013020016), Basic scientific research foundation of Northeast University under Grant N110208001, Starting foundation of Northeast University under Grant 29321006, and Shandong Province Key Laboratory of Intelligent Information Processing and Network Security (Liaocheng University). Ruben Ruiz is partially supported by the Spanish Ministry of Economy and Competitiveness, under the project "RESULT - Realistic Extended Scheduling Using Light Techniques" with reference DPI2012-36243-C02-01 co-financed by the European Union and FEDER funds and by the Universitat Politecnica de Valencia, for the project MRPIV with reference PAID/2012/202.Pan, Q.; Ruiz GarcÃa, R. (2014). An effective iterated greedy algorithm for the mixed no-idle flowshop scheduling problem. Omega. 44:41-50. https://doi.org/10.1016/j.omega.2013.10.002S41504
Permutation flowshop scheduling problem with total core idle time minimization
-Part of special issue 10th IFAC Conference on Manufacturing Modelling, Management and Control MIM 2022: Nantes, France, 22-24 June 2022
-Copyright © 2022 The Authors. This is an open access article under the CC BY-NC-ND license (https://creativecommons.org/licenses/by-nc-nd/4.0/)In this paper, we present a deterministic permutation flowshop scheduling problem with a new objective function, the total core idle time. The interest of this objective is related to reduce the energy consumption of the system, taking into account that the energy needed during the processing times is constant, and that machines are switched off during the front and back idle times. Therefore, the energy consumption is dependent on the time where machines are in stand-by mode, i.e during the idle time of machines between jobs, named as core idle times. Constructive heuristics and metaheuristics are adapted from the permutation flowshop scheduling literature for classical objectives as makespan and total completion time. Additionally, a new variant of one of the metaheuristic is proposed, the VBIH-P. An experimental evaluation has been carried out to analyse the performance of all the methods. The results show an excellent performance of the VBIH-P compared to the adapted methods
An efficient discrete artificial bee colony algorithm for the blocking flow shop problem with total flowtime minimization
This paper presents a high performing Discrete Artificial Bee Colony algorithm for the blocking flow shop problem with flow time criterion. To develop the proposed algorithm, we considered four strategies for the food source phase and two strategies for each of the three remaining phases (employed bees, onlookers and scouts). One of the strategies tested in the food source phase and one implemented in the employed bees phase are new. Both have been proved to be very effective for the problem at hand. The initialization scheme named HPF2(¿, µ) in particular, which is used to construct the initial food sources, is shown in the computational evaluation to be one of the main procedures that allow the DABC_RCT to obtain good solutions for this problem. To find the best configuration of the algorithm, we used design of experiments (DOE). This technique has been used extensively in the literature to calibrate the parameters of the algorithms but not to select its configuration. Comparing it with other algorithms proposed for this problem in the literature demonstrates the effectiveness and superiority of the DABC_RCTPeer ReviewedPostprint (author’s final draft
New efficient constructive heuristics for the hybrid flowshop to minimise makespan: A computational evaluation of heuristics
This paper addresses the hybrid flow shop scheduling problem to minimise makespan, a well-known scheduling problem for which many constructive heuristics have been proposed in the literature. Nevertheless, the state of the art is not clear due to partial or non homogeneous comparisons. In this paper, we review these heuristics and perform a comprehensive computational evaluation to determine which are the most efficient ones. A total of 20 heuristics are implemented and compared in this study. In addition, we propose four new heuristics for the problem. Firstly, two memory-based constructive heuristics are proposed, where a sequence is constructed by inserting jobs one by one in a partial sequence. The most promising insertions tested are kept in a list. However, in contrast to the Tabu search, these insertions are repeated in future iterations instead of forbidding them. Secondly, we propose two constructive heuristics based on Johnson’s algorithm for the permutation flowshop scheduling problem. The computational results carried out on an extensive testbed show that the new proposals outperform the existing heuristics.Ministerio de Ciencia e Innovación DPI2016-80750-
MILP-based local search procedures for minimizing total tardiness in the No-idle Permutation Flowshop Problem
We consider the No-idle Permutation Flowshop Scheduling Problem (NPFSP) with a total tardiness criterion. We present two Mixed Integer Linear Programming (MILP) formulations based on positional and precedence variables, respectively. We study six local search procedures that explore two different neighborhoods by exploiting the MILP formulations. Our computational experiments show that two of the proposed procedures strongly outperform the state-of-the-art metaheuristic. We update 63% of the best known solutions of the instances in Taillards’ benchmark, and 77% if we exclude those instances for which we proved that the previous best known solutions are optimal
An Iterated Greedy Heuristic for Mixed No-Wait Flowshop Problems
[EN] The mixed no-wait flowshop problem with both wait and no-wait constraints has many potential real-life applications. The problem can be regarded as a generalization of the traditional permutation flowshop and the no-wait flowshop. In this paper, we study, for the first time, this scheduling setting with makespan minimization. We first propose a mathematical model and then we design a speed-up makespan calculation procedure. By introducing a varying number of destructed jobs, a modified iterated greedy algorithm is proposed for the considered problem which consists of four components: 1) initialization solution construction; 2) destruction; 3) reconstruction; and 4) local search. To further improve the intensification and efficiency of the proposal, insertion is performed on some neighbor jobs of the best position in a sequence during the initialization, solution construction, and reconstruction phases. After calibrating parameters and components, the proposal is compared with five existing algorithms for similar problems on adapted Taillard benchmark instances. Experimental results show that the proposal always obtains the best performance among the compared methods.This work was supported in part by the National Natural Science Foundation of China under Grant 61572127 and 61272377, in part by the Key Research and Development Program in Jiangsu Province under Grant BE2015728, and in part by the Collaborative Innovation Center of Wireless Communications Technology. The work of R. Ruiz was supported in part by the Spanish Ministry of Economy and Competitiveness through the project "SCHEYARD-Optimization of Scheduling Problems in Container Yards" under Grant DPI2015-65895-R, and in part by the FEDER Funds.Wang, Y.; Li, X.; Ruiz GarcÃa, R.; Sui, S. (2018). An Iterated Greedy Heuristic for Mixed No-Wait Flowshop Problems. IEEE Transactions on Cybernetics. 48(5):1553-1566. https://doi.org/10.1109/TCYB.2017.2707067S1553156648
The Distributed and Assembly Scheduling Problem
Tesis por compendio[EN] Nowadays, manufacturing systems meet different new global challenges and
the existence of a collaborative manufacturing environment is essential to face
with. Distributed manufacturing and assembly systems are two manufacturing
systems which allow industries to deal with some of these challenges. This
thesis studies a production problem in which both distributed manufacturing
and assembly systems are considered. Although distributed manufacturing
systems and assembly systems are well-known problems and have been extensively
studied in the literature, to the best of our knowledge, considering
these two systems together as in this thesis is the first effort in the literature.
Due to the importance of scheduling optimization on production performance,
some different ways to optimize the scheduling of the considered problem are
discussed in this thesis.
The studied scheduling setting consists of two stages: A production and an
assembly stage. Various production centers make the first stage. Each of these
centers consists of several machines which are dedicated to manufacture jobs.
A single assembly machine is considered for the second stage. The produced
jobs are assembled on the assembly machine to form final products through a
defined assembly program.
In this thesis, two different problems regarding two different production
configurations for the production centers of the first stage are considered.
The first configuration is a flowshop that results in what we refer to as the
Distributed Assembly Permutation Flowshop Scheduling Problem (DAPFSP).
The second problem is referred to as the Distributed Parallel Machine and
Assembly Scheduling Problem (DPMASP), where unrelated parallel machines
configure the production centers. Makespan minimization of the product on the
assembly machine located in the assembly stage is considered as the objective
function for all considered problems.
In this thesis some extensions are considered for the studied problems
so as to bring them as close as possible to the reality of production shops.
In the DAPFSP, sequence dependent setup times are added for machines in
both production and assembly stages. Similarly, in the DPMASP, due to
technological constraints, some defined jobs can be processed only in certain
factories.
Mathematical models are presented as an exact solution for some of the
presented problems and two state-of-art solvers, CPLEX and GUROBI are
used to solve them. Since these solvers are not able to solve large sized
problems, we design and develop heuristic methods to solve the problems. In
addition to heuristics, some metaheuristics are also designed and proposed to
improve the solutions obtained by heuristics. Finally, for each proposed problem,
the performance of the proposed solution methods is compared through
extensive computational and comprehensive ANOVA statistical analysis.[ES] Los sistemas de producción se enfrentan a retos globales en los que el concepto
de fabricación colaborativa es crucial para poder tener éxito en el entorno
cambiante y complejo en el que nos encontramos. Una caracterÃstica de los sistemas
productivos que puede ayudar a lograr este objetivo consiste en disponer
de una red de fabricación distribuida en la que los productos se fabriquen en
localizaciones diferentes y se vayan ensamblando para obtener el producto
final. En estos casos, disponer de modelos y herramientas para mejorar el
rendimiento de sistemas de producción distribuidos con ensamblajes es una
manera de asegurar la eficiencia de los mismos.
En esta tesis doctoral se estudian los sistemas de fabricación distribuidos
con operaciones de ensamblaje. Los sistemas distribuidos y los sistemas con
operaciones de ensamblaje han sido estudiados por separado en la literatura.
De hecho, no se han encontrado estudios de sistemas con ambas caracterÃsticas
consideradas de forma conjunta.
Dada la complejidad de considerar conjuntamente ambos tipos de sistemas
a la hora de realizar la programación de la producción en los mismos, se ha
abordado su estudio considerando un modelo bietápico en la que en la primera
etapa se consideran las operaciones de producción y en la segunda se plantean
las operaciones de ensamblaje.
Dependiendo de la configuración de la primera etapa se han estudiado dos
variantes. En la primera variante se asume que la etapa de producción está
compuesta por sendos sistemas tipo flowshop en los que se fabrican los componentes
que se ensamblan en la segunda etapa (Distributed Assembly Permutation
Flowshop Scheduling Problem o DAPFSP). En la segunda variante
se considera un sistema de máquinas en paralelo no relacionadas (Distributed
Parallel Machine and Assembly Scheduling Problem o DPMASP). En ambas
variantes se optimiza la fecha de finalización del último trabajo secuenciado
(Cmax) y se contempla la posibilidad que existan tiempos de cambio (setup)
dependientes de la secuencia de trabajos fabricada. También, en el caso
DPMASP se estudia la posibilidad de prohibir o no el uso de determinadas
máquinas de la etapa de producción.
Se han desarrollado modelos matemáticos para resolver algunas de las
variantes anteriores. Estos modelos se han resuelto mediante los programas
CPLEX y GUROBI en aquellos casos que ha sido posible. Para las instancias
en los que el modelo matemático no ofrecÃa una solución al problema se han
desarrollado heurÃsticas y metaheurÃsticas para ello.
Todos los procedimientos anteriores han sido estudiados para determinar
el rendimiento de los diferentes algoritmos planteados. Para ello se ha realizado
un exhaustivo estudio computacional en el que se han aplicado técnicas
ANOVA.
Los resultados obtenidos en la tesis permiten avanzar en la comprensión
del comportamiento de los sistemas productivos distribuidos con ensamblajes,
definiendo algoritmos que permiten obtener buenas soluciones a este tipo de
problemas tan complejos que aparecen tantas veces en la realidad industrial.[CA] Els sistemes de producció s'enfronten a reptes globals en què el concepte de
fabricació col.laborativa és crucial per a poder tindre èxit en l'entorn canviant
i complex en què ens trobem. Una caracterÃstica dels sistemes productius
que pot ajudar a aconseguir este objectiu consistix a disposar d'una xarxa de
fabricació distribuïda en la que els productes es fabriquen en localitzacions
diferents i es vagen acoblant per a obtindre el producte final. En estos casos,
disposar de models i ferramentes per a millorar el rendiment de sistemes de
producció distribuïts amb acoblaments és una manera d'assegurar l'eficiència
dels mateixos.
En esta tesi doctoral s'estudien els sistemes de fabricació distribuïts amb
operacions d'acoblament. Els sistemes distribuïts i els sistemes amb operacions
d'acoblament han sigut estudiats per separat en la literatura però, en allò
que es coneix, no s'han trobat estudis de sistemes amb ambdós caracterÃstiques
conjuntament. Donada la complexitat de considerar conjuntament ambdós
tipus de sistemes a l'hora de realitzar la programació de la producció en els
mateixos, s'ha abordat el seu estudi considerant un model bietà pic en la que
en la primera etapa es consideren les operacions de producció i en la segona es
plantegen les operacions d'acoblament.
Depenent de la configuració de la primera etapa s'han estudiat dos variants.
En la primera variant s'assumix que l'etapa de producció està composta per
sengles sistemes tipus flowshop en els que es fabriquen els components que
s'acoblen en la segona etapa (Distributed Assembly Permutation Flowshop
Scheduling Problem o DAPFSP). En la segona variant es considera un sistema
de mà quines en paral.lel no relacionades (Distributed Parallel Machine and
Assembly Scheduling Problem o DPMASP). En ambdós variants s'optimitza
la data de finalització de l'últim treball seqüenciat (Cmax) i es contempla la
possibilitat que existisquen temps de canvi (setup) dependents de la seqüència
de treballs fabricada. També, en el cas DPMASP s'estudia la possibilitat de
prohibir o no l'ús de determinades mà quines de l'etapa de producció.
S'han desenvolupat models matemà tics per a resoldre algunes de les variants
anteriors. Estos models s'han resolt per mitjà dels programes CPLEX
i GUROBI en aquells casos que ha sigut possible. Per a les instà ncies en
què el model matemà tic no oferia una solució al problema s'han desenrotllat
heurÃstiques i metaheurÃsticas per a això. Tots els procediments anteriors han
sigut estudiats per a determinar el rendiment dels diferents algoritmes plantejats.
Per a això s'ha realitzat un exhaustiu estudi computacional en què s'han
aplicat tècniques ANOVA.
Els resultats obtinguts en la tesi permeten avançar en la comprensió del
comportament dels sistemes productius distribuïts amb acoblaments, definint
algoritmes que permeten obtindre bones solucions a este tipus de problemes
tan complexos que apareixen tantes vegades en la realitat industrial.Hatami, S. (2016). The Distributed and Assembly Scheduling Problem [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/64072TESISCompendi
- …