Buscar
Mostrando ítems 1-10 de 44
Artículo
Constructive and composite heuristics for the 2-stage assembly scheduling problem with periodic maintenance and makespan objective
(Elsevier, 2022-11-15)
This paper addresses the 2-stage assembly scheduling problem to minimise makespan with availability constraints, where the machines are not always available due to periodic maintenance activities. To the best of our ...
Artículo
Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling
(Elsevier, 2020-09)
This paper focuses on two components of idle time and waiting time, namely core idle time, ∑CITi, and core waiting time, ∑CWTj. Both measures are relevant indicators of the efficiency of production systems, since they are ...
Artículo
New efficient constructive heuristics for the two-stage multi-machine assembly scheduling problem
(Elsevier, 2020-02)
In this paper, we address the two-stage multi-machine assembly scheduling problem, a layout consisting of several dedicated parallel machines in the first stage and identical parallel machines in the second stage. The ...
Artículo
Using real-time information to reschedule jobs in a flowshop with variable processing times
(Elsevier, 2019-03)
In a time where detailed, instantaneous and accurate information on shop-floor status is becoming available in many manufacturing companies due to Information Technologies initiatives such as Smart Factory or Industry 4.0, ...
Ponencia
Modelos para la resolución de la programación de quirófanos
(ADINGOR (Asociación para el desarrollo de la ingeniería de organización), 2009)
Ponencia
Influencia de la granularidad en las prestaciones de algoritmos paralelos
(ADINGOR ( Asociación para el Desarrollo de la Ingeniería de Organización), 2006)
En el ámbito del procesamiento paralelo en computación, se conoce como granularidad la relación entre el tiempo de computación y el tiempo de comunicación en un algoritmo paralelo. En el presente trabajo se presentan las ...
Artículo
Single machine scheduling with periodic machine availability
(Elsevier Ltd, 2018-09)
In this paper we address the problem of scheduling jobs on a single machine with cyclical machine availability periods. In this problem, the scheduling horizon is composed of periods where the machine is available followed ...
Ponencia
Permutation flowshop problems with initial availability constraints: Characterisation and Analysis
(ADINGOR ( Asociación para el Desarrollo de la Ingeniería de Organización), 2010)
This paper characterises the initial availability constraint problems in a permutation flowshop layout considering different objectives: makespan, total flowtime and idle time. The goal is to analyse the structure ...
Ponencia
Two-agent scheduling problem with flowtime objective: Analysis of problem and exact method
(TUM School of Management, 2014)
Artículo
Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective
(Elsevier, 2019)
In this paper we address the classical hybrid flow shop scheduling problem with makespan objective. As this problem is known to be NP-hard and a very common layout in real-life manufacturing scenarios, many studies have ...