201 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-
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-
Multi-objective sequence dependent setup times permutation flowshop: A new algorithm and a comprehensive study
The permutation flowshop scheduling problem has been thoroughly studied in recent decades, both from single objective as well as from multi-objective perspectives. To the best of our knowledge, little has been done regarding the multi-objective flowshop with Pareto approach when sequence dependent setup times are considered. As setup times and multi-criteria problems are important in industry, we must focus on this area. We propose a simple, yet powerful algorithm for the sequence dependent setup times flowshop problem with several criteria. The presented method is referred to as Restarted Iterated Pareto Greedy or RIPG and is compared against the best performing approaches from the relevant literature. Comprehensive computational and statistical analyses are carried out in order to demonstrate that the proposed RIPG method clearly outperforms all other algorithms and, as a consequence, it is a state-of- art method for this important and practical scheduling problemThe authors thank the anonymous referees for their careful and detailed comments which have helped improve this manuscript considerably. This work is partially financed by the Spanish Ministry of Science and Innovation, under the projects "SMPA-Advanced Parallel Multiobjective Sequencing: Practical and Theorerical Advances" with reference DPI2008-03511/DPI and "RESULT-Realistic Extended Scheduling Using Light Techniques" with reference DPI2012-36243-C02-01 and by the Small and Medium Industry of the Generalitat Valenciana (IMPIVA) and by the European Union through the European Regional Development Fund (FEDER) inside the R+D program "Ayudas dirigidas a Institutos Tecnologicos de la Red IMPIVA" during the year 2011, with project numbers IMDEEA/2011/142 and IMDEEA/2012/143.Ciavotta, M.; Minella, GG.; Ruiz García, R. (2013). Multi-objective sequence dependent setup times permutation flowshop: A new algorithm and a comprehensive study. European Journal of Operational Research. 227(2):301-313. https://doi.org/10.1016/j.ejor.2012.12.031S301313227
Iterative beam search algorithms for the permutation flowshop
We study an iterative beam search algorithm for the permutation flowshop
(makespan and flowtime minimization). This algorithm combines branching
strategies inspired by recent branch-and-bounds and a guidance strategy
inspired by the LR heuristic. It obtains competitive results, reports many
new-best-so-far solutions on the VFR benchmark (makespan minimization) and the
Taillard benchmark (flowtime minimization) without using any NEH-based
branching or iterative-greedy strategy. The source code is available at:
https://gitlab.com/librallu/cats-pfsp
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
Efficient heuristics for the parallel blocking flow shop scheduling problem
We consider the NP-hard problem of scheduling n jobs in F identical parallel flow shops, each consisting of a series of m machines, and doing so with a blocking constraint. The applied criterion is to minimize the makespan, i.e., the maximum completion time of all the jobs in F flow shops (lines). The Parallel Flow Shop Scheduling Problem (PFSP) is conceptually similar to another problem known in the literature as the Distributed Permutation Flow Shop Scheduling Problem (DPFSP), which allows modeling the scheduling process in companies with more than one factory, each factory with a flow shop configuration. Therefore, the proposed methods can solve the scheduling problem under the blocking constraint in both situations, which, to the best of our knowledge, has not been studied previously. In this paper, we propose a mathematical model along with some constructive and improvement heuristics to solve the parallel blocking flow shop problem (PBFSP) and thus minimize the maximum completion time among lines. The proposed constructive procedures use two approaches that are totally different from those proposed in the literature. These methods are used as initial solution procedures of an iterated local search (ILS) and an iterated greedy algorithm (IGA), both of which are combined with a variable neighborhood search (VNS). The proposed constructive procedure and the improved methods take into account the characteristics of the problem. The computational evaluation demonstrates that both of them –especially the IGA– perform considerably better than those algorithms adapted from the DPFSP literature.Peer ReviewedPostprint (author's final draft
A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem
As the interest of practitioners and researchers in scheduling in a multi-factory environment is growing, there is an increasing need to provide efficient algorithms for this type of decision problems, characterised by simultaneously addressing the assignment of jobs to different factories/workshops and their subsequent scheduling. Here we address the so-called distributed permutation flowshop scheduling problem, in which a set of jobs has to be scheduled over a number of identical factories, each one with its machines arranged as a flowshop. Several heuristics have been designed for this problem, although there is no direct comparison among them. In this paper, we propose a new heuristic which exploits the specific structure of the problem. The computational experience carried out on a well-known testbed shows that the proposed heuristic outperforms existing state-of-the-art heuristics, being able to obtain better upper bounds for more than one quarter of the problems in the testbed.Ministerio de Ciencia e Innovación DPI2010-15573/DP
A speed-up procedure for the hybrid flow shop scheduling problem
Article number 115903During the last decades, hundreds of approximate algorithms have been proposed in the literature addressing
flow-shop-based scheduling problems. In the race for finding the best proposals to solve these problems, speedup procedures to compute objective functions represent a key factor in the efficiency of the algorithms. This
is the case of the well-known Taillard’s accelerations proposed for the traditional flow shop with makespan
minimisation or several other accelerations proposed for related scheduling problems. Despite the interest in
proposing such methods to improve the efficiency of approximate algorithms, to the best of our knowledge,
no speed-up procedure has been proposed so far in the hybrid flow shop literature. To tackle this challenge,
we propose in this paper a speed-up procedure for makespan minimisation, which can be incorporate in
insertion-based neighbourhoods using a complete representation of the solutions. This procedure is embedded
in the traditional iterated greedy algorithm. The computational experience shows that even incorporating the
proposed speed-up procedure in this simple metaheuristic results in outperforming the best metaheuristic for
the problem under consideration.Junta de Andalucía(España) US-1264511Ministerio de Ciencia e Innovación (España) PID2019-108756RB-I0
Iterated Greedy methods for the distributed permutation flowshop scheduling problem
[EN] Large manufacturing firms operate more than one production center. As a result, in relation to scheduling problems, which factory manufactures which product is an important consideration. In this paper we study an extension of the well known permutation flowshop scheduling problem in which there is a set of identical factories, each one with a flowshop structure. The objective is to minimize the maximum completion time or makespan among all factories. The resulting problem is known as the distributed permutation flowshop and has attracted considerable interest over the last few years. Contrary to the recent trend in the scheduling literature, where complex nature-inspired or metaphor-based methods are often proposed, we present simple Iterated Greedy algorithms that have performed well in related problems. Improved initialization, construction and destruction procedures, along with a local search with a strong intensification are proposed. The result is a very effective algorithm with little problem-specific knowledge that is shown to provide demonstrably better solutions in a comprehensive and thorough computational and statistical campaign.Ruben Ruiz is partially 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. Quan-Ke Pan is supported by the National Natural Science Foundation of China (Grant No. 51575212).Ruiz García, R.; Pan, Q.; Naderi, B. (2019). Iterated Greedy methods for the distributed permutation flowshop scheduling problem. Omega. 83:213-222. https://doi.org/10.1016/j.omega.2018.03.004S2132228
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
- …