Buscar
Mostrando ítems 1-10 de 19
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, ...
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 ...
Artículo
Setting a common due date in a constrained flowshop: A variable neighbourhood search approach
(2010)
In this paper we study a due date setting problem in a flowshop layout. The problem consists of scheduling a set of jobs arriving to the system together with jobs already present (denoted as old jobs), in order to set a ...
Artículo
Single machine scheduling with periodic machine availability
(Elsevier, 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 ...
Artículo
New approximate algorithms for the customer order scheduling problem with total completion time objective
(Elsevier, 2017-02)
In this paper, we study a customer order scheduling problem where a number of orders, composed of several product types, have to be scheduled on a set of parallel machines, each one capable to process a single product type. ...
Artículo
Constructive heuristics for the unrelated parallel machines scheduling problem with machine eligibility and setup times
(Elsevier, 2019-05)
This work considers a scheduling problem identified in a factory producing customised Heating, Ventilation and Air Conditioning (HVAC) equipment. More specifically, the metal folding section is modelled as unrelated parallel ...
Ponencia
Ajustes en el Proceso de una Unidad Quirúrgica. Un estudio basado en Simulación
(ADINGOR ( Asociación para el Desarrollo de la Ingeniería de Organización), 2010)
Presentamos un modelo de simulación basada en Eventos Discretos para manejar la incertidumbre en la duración real de la intervención y en la llegada de pacientes urgentes (grandes quemados) que dislocan la planificación ...