Skip to main content

REALISTIC EXTENDED SCHEDULING USING LIGHT TECHNIQUES

DPI2012-36243-C02-01

•
Funding agency name Ministerio de Economía y Competitividad
Funding agency acronym MINECO
Program Programa Nacional de Proyectos de Investigación Fundamental
Subprogram Subprograma de Proyectos de Investigación Fundamental no Orientada
Call Proyectos I+D
Call year 2012
State Plan 2008-2011 Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica
Management unit Secretaría de Estado de Investigación, Desarrollo e Innovación
Beneficiary centre UNIVERSITAT POLITÈCNICA DE VALÈNCIA

Resultados relacionados

Resultados totales (Incluyendo duplicados): 13
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

A scatter search algorithm for the distributed permutation flowshop scheduling problem

  • Naderi, Bahman
  • Ruiz García, Rubén
The distributed permutation flowshop problem has been recently proposed as a generalization of the regular flowshop setting where more than one factory is available to process jobs. Distributed manufacturing is a common situation for large enterprises that compete in a globalized market. The problem has two dimensions: assigning jobs to factories and scheduling the jobs assigned to each factory. Despite being recently introduced, this interesting scheduling problem has attracted attention and several heuristic and metaheuristic methods have been proposed in the literature. In this paper we present a scatter search (SS) method for this problem to optimize makespan. SS has seldom been explored for flowshop settings. In the proposed algorithm we employ some advanced techniques like a reference set made up of complete and partial solutions along with other features like restarts and local search. A comprehensive computational campaign including 10 existing algorithms, together with statistical analyses, shows that the proposed scatter search algorithm produces better results than existing algorithms by a significant margin. Moreover all 720 known best solutions for this problem are improved., 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.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

An effective iterated greedy algorithm for the mixed no-idle flowshop scheduling problem

  • Pan, Quan-Ke
  • Ruiz García, Rubén
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.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Cloud Workflow Scheduling with Deadlines and Time Slot Availability

  • Li, Xiaoping
  • Qian, L.
  • Ruiz García, Rubén
[EN] Allocating service capacities in cloud computing is based on the assumption that they are unlimited and can be used at any time. However, available service capacities change with workload and cannot satisfy users' requests at any time from the cloud provider's perspective because cloud services can be shared by multiple tasks. Cloud service providers provide available time slots for new user's requests based on available capacities. In this paper, we consider workflow scheduling with deadline and time slot availability in cloud computing. An iterated heuristic framework is presented for the problem under study which mainly consists of initial solution construction, improvement, and perturbation. Three initial solution construction strategies, two greedy-and fair-based improvement strategies and a perturbation strategy are proposed. Different strategies in the three phases result in several heuristics. Experimental results show that different initial solution and improvement strategies have different effects on solution qualities., This work has been supported by the National Natural Science Foundation of China (Nos. 61572127, 61272377) and the Key Research & Development Program in Jiangsu Province (No. BE2015728). Ruben Ruiz is partially supported by the Spanish Ministry of Economy and Competitiveness, under the project "RESULT - Realistic Extended Scheduling Using Light Techniques" (No. DPI2012-36243-C02-01) partially financed with FEDER funds.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

A decomposition approach to dual shuttle automated storage and retrieval systems

  • Wauters, Tony
  • Chirstiaens, Jan
  • ALVAREZ-VALDES, RAMÓN
  • Vauden Berghe, Greet
  • Villa Juliá, Mª Fulgencia|||0000-0003-0019-8777
[EN] Automated Storage and Retrieval Systems (AS/RS) have become vital in today¿s distribution and production environments, however it remains necessary to equip them with more efficient operational control policies. Motivated by real situations encountered by companies employing AS/RS, the present paper studies a miniload AS/RS system, with a dual shuttle crane in which a set of storage and retrieval requests must be scheduled such that the prioritized waiting time is minimized. Dual shuttle cranes have received minimal academic attention and thus continue to pose new problems that must be solved. The miniload AS/RS problem is addressed by decomposing it into a location assignment and sequencing problem. Different heuristic strategies are introduced for making the assignments, while a general mathematical model and efficient branch and bound procedure are proposed for optimizing the sequence. Additionally, a fast metaheuristic capable of solving larger instances is also developed. A set of realworld based benchmarks with varying characteristics is generated to evaluate the proposed methods. Very small instances prove the only for which optimal sequences are found in reasonable calculation time. Experimental results demonstrate the effectiveness of the heuristic decomposition method., This study has been partially supported by the Spanish Ministry of Economy and Competitiveness with the projects DPI2011-24977 and DPI2014-53665-P, DPI2012-36243-C02-01, DPI2015-65895-R co-financed by FEDER funds and by Generalitat Valenciana, PROMETEO/2013/049. Partially supported by FWO (Belgium) travel grant V448915N. Editorial consultation provided by Luke Connolly (KU Leuven)
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Heuristics and metaheuristics for the distributed assembly permutation flowshop scheduling problem with sequence dependent setup times

  • Hatami, Sara
  • Ruiz García, Rubén
  • Andrés Romano, Carlos|||0000-0003-4453-4891
We consider a Distributed Assembly Permutation Flowshop Scheduling Problem with sequence dependent setup times and the objective of makespan minimization. The problem consists of two stages, production and assembly. The first stage comprises f identical factories, where each factory is a flowshop that produces jobs which are later assembled into final products through an identical assembly program in a second assembly stage made by a single machine. Both stages have sequence dependent setup times. This-is a realistic and complex problem and therefore, we propose two simple heuristics and two metaheuristics to solve it. A complete calibration and analysis through a Design Of Experiments (DOE) approach is carried out. In the process, important knowledge of the studied problem is obtained as well as some simplifications for the powerful Iterated Greedy methodology which results in a simpler approach with less parameters. Finally, the performance of the proposed methods is compared through extensive computational and statistical experiments. (C) 2015 Elsevier B.V. All rights reserved., 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. Carlos Andres-Romano is partially supported by the Spanish Ministry of Economy and Competitiveness (TRA2013-48180-C3-3-P).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Heuristics for periodical batch job scheduling in a MapReduce computing framework

  • Xiaoping Li
  • Tianze Jiang
  • Ruiz García, Rubén
Task scheduling has a significant impact on the performance of the MapReduce computing framework. In this paper, a scheduling problem of periodical batch jobs with makespan minimization is considered. The problem is modeled as a general two-stage hybrid flow shop scheduling problem with schedule-dependent setup times. The new model incorporates the data locality of tasks and is formulated as an integer program. Three heuristics are developed to solve the problem and an improvement policy based on data locality is presented to enhance the methods. A lower bound of the makespan is derived. 150 instances are randomly generated from data distributions drawn from a real cluster. The parameters involved in the methods are set according to different cluster setups. The proposed heuristics are compared over different numbers of jobs and cluster setups. Computational results show that the performance of the methods is highly dependent on both the number of jobs and the cluster setups. The proposed improvement policy is effective and the impact of the input data distribution on the policy is analyzed and tested., This work is supported by the National Natural Science Foundation of China (No. 61272377) and the Specialized Research Fund for the Doctoral Program of Higher Education (No. 20120092110027). Ruben Ruiz is partially supported by the Spanish Ministry of Economy and Competitiveness, under the project "RESULT - Realistic Extended Scheduling Using Light Techniques" (No. DPI2012-36243-C02-01) partially financed with FEDER funds.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Multi-objective sequence dependent setup times permutation flowshop: A new algorithm and a comprehensive study

  • Ciavotta, Michele
  • Minella, Gerardo Gabriel
  • Ruiz García, Rubén
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 problem, The 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.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

An Exact Algorithm for the Shortest Path Problem With Position-Based Learning Effects

  • Wang, Yamin
  • Li, Xiaoping
  • Ruiz García, Rubén
[EN] The shortest path problems (SPPs) with learning effects (SPLEs) have many potential and interesting applications. However, at the same time they are very complex and have not been studied much in the literature. In this paper, we show that learning effects make SPLEs completely different from SPPs. An adapted A* (AA*) is proposed for the SPLE problem under study. Though global optimality implies local optimality in SPPs, it is not the case for SPLEs. As all subpaths of potential shortest solution paths need to be stored during the search process, a search graph is adopted by AA* rather than a search tree used by A*. Admissibility of AA* is proven. Monotonicity and consistency of the heuristic functions of AA* are redefined and the corresponding properties are analyzed. Consistency/monotonicity relationships between the heuristic functions of AA* and those of A* are explored. Their impacts on efficiency of searching procedures are theoretically analyzed and experimentally evaluated., This work was supported in part by the National Natural Science Foundation of China under Grant 61572127 and Grant 61272377, and in part by the Specialized Research Fund for the Doctoral Program of Higher Education under Grant 20120092110027. The work of R. Ruiz was supported in part by the Spanish Ministry of Economy and Competitiveness under Project "RESULT-Realistic Extended Scheduling Using Light Techniques" under Grant DPI2012-36243-C02-01, and in part by the FEDER.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

The Distributed Assembly Parallel Machine Scheduling Problem with eligibility constraints

  • Hatami, Sara
  • Ruiz García, Rubén
  • Andrés Romano, Carlos|||0000-0003-4453-4891
[EN] In this paper we jointly consider realistic scheduling extensions: First we study the distributed unrelated parallel machines problems by which there is a set of identical factories with parallel machines in a production stage. Jobs have to be assigned to factories and to machines. Additionally, there is an assembly stage with a single assembly machine. Finished jobs at the manufacturing stage are assembled into final products in this second assembly stage. These two joint features are referred to as the distributed assembly parallel machine scheduling problem or DAPMSP. The objective is to minimize the makespan in the assembly stage. Due to technological constraints, machines cannot be left empty and some jobs might be processed on certain factories only. We propose a mathematical model and two high performing heuristics. The model is tested with two state-of-the-art solvers and, together with the heuristics, 2220 instances are solved in a comprehensive computational experiments. Results show that the proposed model is able to solve moderately-sized instances and one of the heuristics is fast, giving close to optimal solutions in less than half a second in the worst case., The Spanish Ministry of Economy and Competitiveness supports Rubén Ruiz, under the project “RESULT-Realistic Extended Scheduling Using Light Techniques” (No. DPI2012-36243-C02-01). Carlos Andrés is partially supported by the project “Hybrid Methods for Horizontal Cooperation in Green Transportation and Logistics GreenCOOP” TRA2013-48180-C3-3-P from the Spanish Ministry of Economy and Competitiveness.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

The distributed assembly permutation flowshop scheduling problem

  • Hatami, Sara
  • Ruiz García, Rubén
  • Andrés Romano, Carlos|||0000-0003-4453-4891
Nowadays, improving the management of complex supply chains is a key to become competitive in the twenty-first century global market. Supply chains are composed of multi-plant facilities that must be coordinated and synchronised to cut waste and lead times. This paper proposes a Distributed Assembly Permutation Flowshop Scheduling Problem (DAPFSP) with two stages to model and study complex supply chains. This problem is a generalisation of the Distributed Permutation Flowshop Scheduling Problem (DPFSP). The first stage of the DAPFSP is composed of f identical production factories. Each one is a flowshop that produces jobs to be assembled into final products in a second assembly stage. The objective is to minimise the makespan. We present first a Mixed Integer Linear Programming model (MILP). Three constructive algorithms are proposed. Finally, a Variable Neighbourhood Descent (VND) algorithm has been designed and tested by a comprehensive ANOVA statistical analysis. The results show that the VND algorithm offers good performance to solve this scheduling problem., Ruben Ruiz is partially supported by the Spanish Ministry of Science and Innovation, under the project 'RESULT - Realistic Extended Scheduling Using Light Techniques' with reference DPI2012-36243-C02-01. Carlos Andres-Romano is partially supported by the Spanish Ministry of Science and Innovation, under the project 'INSAMBLE' - Scheduling at assembly/disassembly synchronised supply chains with reference DPI2011-27633.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Cyclic scheduling of perishable products in parallel machine with release dates, due dates and deadlines

  • Shirvani, Nargess
  • Ruiz García, Rubén
  • Shadrokh, Shahram
This paper deals with a realistic cyclic scheduling problem in the food industry environment in which parallel machines are considered to process perishable jobs with given release dates, due dates and deadlines. Jobs are subject to post-production shelf life limitation and must be delivered to retailers during the corresponding time window bounded by due dates and deadlines. Both early and tardy jobs are penalized by partial weighted earliness/tardiness functions and the overall problem is to provide a cyclic schedule of minimum cost. A mixed integer programming model is proposed and a heuristic solution beside an iterated greedy algorithm is developed to generate good and feasible solutions for the problem. The proposed MIP, heuristic and iterated greedy produce a series of solutions covering a wide range of cases from slow optimal solutions to quick and approximated schedules., 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.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

The Railway Line Frequency and Size Setting Problem

  • De-Los-Santos, Alicia
  • Laporte, Gilbert
  • Mesa, Juan A.
  • Perea Rojas Marcos, Federico
[EN] The problem studied in this paper takes as input data a set of lines forming a railway network, and an origin¿destination (OD) matrix. The OD pairs may use either the railway network or an alternative transportation mode. The objective is to determine the frequency/headway of each line as well as its number of carriages, so that the net profit of the railway network is maximized. We propose a mixed integer non-linear programming formulation for this problem. Because of the computational intractability of this model, we develop four algorithms: a mixed integer linear programming (MIP) model, a MIP-based iterative algorithm, a shortest-path based algorithm, and a local search. These four algorithms are tested and compared over a set of randomly generated instances. An application over a case study shows that only the local search heuristic is capable of dealing with large instances., This research was partly funded by the Canadian Natural Sciences and Engineering Research Council under Grant 2015-06189, by the Ministerio de Economía y Competitividad (Spain)/FEDER under projects MTM2012-37048, MTM2015-67706-P and DPI2012-36243-C02-01, and by Junta de Andalucía (Spain)/FEDER under excellence project P10-FQM-5849. Part of this research was done while Federico Perea was enjoying a research visit to CIRRELT, funded by the Universitat Politècnica de València, under program PAID-00-15. This support is gratefully acknowledged. Thanks are due to the referees for their valuable comments.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

New hard benchmark for flowshop scheduling problems minimising makespan

  • Vallada Regalado, Eva|||0000-0003-3918-1788
  • Ruiz García, Rubén
  • Framinan, Jose M.
[EN] In this work a new benchmark of hard instances for the permutation flowshop scheduling problem with the objective of minimising the makespan is proposed. The new benchmark consists of 240 large instances and 240 small instances with up to 800 jobs and 60 machines. One of the objectives of the work is to generate a benchmark which satisfies the desired characteristics of any benchmark: comprehensive, amenable for statistical analysis and discriminant when several algorithms are compared. An exhaustive experimental procedure is carried out in order to select the hard instances, generating thousands of instances and selecting the hardest ones from the point of view of a gap computed as the difference between very good upper and lower bounds for each instance. Extensive generation and computational experiments, which have taken almost six years of combined CPU time, demonstrate that the proposed benchmark is harder and with more discriminant power than the most common benchmark from the literature. Moreover, a website is developed for researchers in order to share sets of instances, best known solutions and lower bounds, etc. for any combinatorial optimisation problem., Eva Vallada and Ruben Ruiz are partially supported by the Spanish Ministry of Science and Innovation, 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. The authors would like to acknowledge the help received from Juan Cabota in the early development of the web of instances.