Browsing by Subject "Makespan"

A Genetic Algorithm for Energy-Efficiency in Job-Shop Scheduling

Salido, Miguel A.; Escamilla Fuster, Joan; Giret Boggino, Adriana Susana; Barber, Federico (Springer Verlag (Germany), 2016-07)

Many real-world scheduling problems are solved to obtain optimal solutions in term of processing time, cost, and quality as optimization objectives. Currently, energyefficiency is also taken into consideration in these ...

A genetic algorithm for the unrelated parallel machine scheduling problemwith sequence dependent setup times

Vallada Regalado, Eva; Ruiz García, Rubén (Elsevier, 2011-06-16)

In this work a genetic algorithm is presented for the unrelated parallel machine scheduling problem in which machine and job sequence dependent setup times are considered. The proposed genetic algorithm includes a fast ...

A model to define setup time sequence dependent flow shop scheduling considering productivity and ergonomic

Asensio Cuesta, Sabina; Gómez-Gasquet, Pedro (Publicaciones DYNA, 2017)

[EN] The manufacturer industry is characterized by the presence of highly repetitive movements, which is a major risk factor associated with work musculoskeletal disorders (WMSDs). Moreover, this risk factor worsens when ...

A review of lot streaming in a flow shop environment with makespan criteria

Gómez-Gasquet, Pedro; Segura Andrés, Rubén; Andrés Romano, Carlos (OmniaScience, 2013)

[EN] Purpose: This paper reviews current literature and contributes a set of findings that capture the current state-of-the-art of the topic of lot streaming in a flow-shop. Design/methodology/approach: A literature ...

An agent-based genetic algorithm for hybrid flowshops with sequence dependent setup times to minimise makespan

Gómez Gasquet, Pedro; Andrés Romano, Carlos; Lario Esteban, Francisco Cruz (Elsevier, 2012-07)

This paper deals with a variant of flowshop scheduling, namely, the hybrid or flexible flowshop with sequence dependent setup times. This type of flowshop is frequently used in the batch production industry and helps reduce ...

An estimation of distribution algorithm for lot-streaming flow shop problems with setup times

Pan, Quan-Ke; Ruiz García, Rubén (Elsevier, 2012-04)

Lot-streaming flow shops have important applications in different industries including textile, plastic, chemical, semiconductor and many others. This paper considers an n-job m-machine lot-streaming flow shop scheduling ...

Effect of routing flexibility on the performance of manufacturing system

Khan, Wasif Ullah; Ali, Mohammed (Universitat Politècnica de València, 2019-07-31)

[EN] This work presented in this paper is based on the simulation of the routing flexibility enabled manufacturing system. In this study four levels of each factor (i.e. routing flexibility, system load conditions, system ...

Energy-efficient scheduling for a flexible flow shop using an improved genetic-simulated annealing algorithm

Dai, Min; Tang, Dunbing; Giret Boggino, Adriana Susana; Salido Gregorio, Miguel Angel; Li, W.D. (Elsevier, 2013-11)

[EN] The traditional production scheduling problem considers performance indicators such as processing time, cost and quality as optimization objectives in manufacturing systems; however, it does not take energy consumption ...

Heuristic algorithms for the unrelated parallel machine scheduling problem with one scarce additional resource

Villa Juliá, Mª Fulgencia; Vallada Regalado, Eva; Fanjul Peyró, Luis (Elsevier, 2018)

[EN] In this paper, we study the unrelated parallel machine scheduling problem with one scarce additional resource to minimise the maximum completion time of the jobs or makespan. Several heuristics are proposed following ...

Heuristics for periodical batch job scheduling in a MapReduce computing framework

Xiaoping Li; Tianze Jiang; Ruiz García, Rubén (Elsevier, 2016-01-01)

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 ...

Matheurísticas para el problema de secuenciación de máquinas paralelas con necesidad de recursos adicionales en los ajustes

Zhang, Ling (2018-12-12)

El problema presentado es bien conocido en la literatura, y está clasificado como NP-duro. Por ello, se hacen necesarios algoritmos eficientes para su resolución. En este trabajo se proponen diferentes algoritmos matheurísticos, ...

Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources

Perea Rojas Marcos, Federico; Fanjul Peyró, Luis; Ruiz García, Rubén (Elsevier, 2017)

[EN] In this paper we analyze a parallel machine scheduling problem in which the processing of jobs on the machines requires a number of units of a scarce resource. This number depends both on the job and on the machine. ...

New hard benchmark for flowshop scheduling problems minimising makespan

Vallada Regalado, Eva; Ruiz García, Rubén; Framinan, Jose M. (Elsevier, 2015-02-01)

[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 ...

Nuevos algoritmos para el problema de secuenciación en máquinas paralelas no relacionadas y generalizaciones

Fanjul Peyró, Luis (2011-02-01)

Para iniciar esta Tesis Doctoral se buscó un problema de producción sencillo pero de amplia aplicación práctica que permitiera adaptarlo para llegar a problemas más generales y de más amplia aplicación. Por este motivo, ...

Planificación de CPUs de máquinas virtuales para comunicar tareas paralelas = Virtual machine schedulers for communicating parallel tasks on distributed platforms

Leuyckx, Keyne Luc (2013-09-26)

The main goal of this project is to work on CPU scheduling algorithms to improve the performance of jobs consisting of parallel communicating tasks and analyse the results with simulation. It is known that the use of Virtual ...

Representacion de un problema de secuenciacion mediante grafos

Andrés Romano, Carlos (2014-07-08)

Se muestra cómo se puede usar un grafo para representar una solución en un problema de secuenciación en mñaquinas y el uso de la técnica de camino crítico para calcular la fecha de fin del último trabajo (makespan)

Restarted Iterated Pareto Greedy algorithm for multi-objective flowshop scheduling problems

Minella, Gerardo Gabriel; Ruiz García, Rubén; Ciavotta, Michele (Elsevier, 2011-11)

Multi-objective optimisation problems have seen a large impulse in the last decades. Many new techniques for solving distinct variants of multi-objective problems have been proposed. Production scheduling, as with other ...

Fanjul Peyró, Luis; Ruiz García, Rubén (Elsevier, 2012-07)

[EN] In this paper we study two generalizations of the well known unrelated parallel machines scheduling problem under makespan (Cmax) minimization. First, a situation in which not every available parallel machine should ...

Size-reduction heuristics for the unrelated parallel machines scheduling problem

Fanjul Peyró, Luis; Ruiz García, Rubén (Elsevier, 2011-01)

[EN] In this paper we study the unrelated parallel machines problem where n independent jobs must be assigned to one out of m parallel machines and the processing time of each job differs from machine to machine. We deal ...

Browsing by Subject "Makespan"

RiuNet: Institutional repository of the Polithecnic University of Valencia

Search RiuNet

Browse

All of RiuNet

My Account

RiuNet Help

Browsing by Subject "Makespan"