Buscar
Mostrando ítems 31-40 de 68
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 ...
Artículo
On the dynamics of closed-loop supply chains with capacity constraints
(Elsevier, 2019)
In this paper, we investigate the dynamic behavior of a closed-loop supply chain with capacity restrictions both in the manufacturing and remanufacturing lines. We assume it operates in a context of a twofold uncertainty ...
Artículo
Demand sharing inaccuracies in supply chains: A simulation study
(Hindawi Limited, 2018)
We investigate two main sources of information inaccuracies (i.e., errors and delays) in demand information sharing along the supply chain (SC). Firstly, we perform a systematic literature review on inaccuracy in demand ...
Artículo
Controllable Processing Times in Project and Production Management: Analysing the trade-off between processing times and the amount of resources
(Hindawi, 2015)
The amount of resources assigned to a task highly influences its processing time. Traditionally, different functions have been used in the literature in order to map the processing time of the task with the amount of ...
Artículo
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 ...
Artículo
A computational evaluation of constructive and improvement heuristics for the blocking flow shop to minimize total flowtime
(Elsevier, 2016)
This paper focuses on the blocking flow shop scheduling problem with the objective of total flowtime minimisation. This problem assumes that there are no buffers between machines and, due to its application to many ...
Artículo
Integrated Project Scheduling and Staff Assignment with Controllable Processing Times
(Hindawi Publishing Corporation, 2014)
This paper addresses a decision problem related to simultaneously scheduling the tasks in a project and assigning the staff to these tasks, taking into account that a task can be performed only by employeeswith certain ...
Artículo
Efficient constructive and composite heuristics for the Permutation Flowshop to minimise total earliness and tardiness
(Elsevier, 2016)
In this paper we address the problem of scheduling jobs in a permutation flowshop with a just-in-time objective, i.e. the minimisation of the sum of total tardiness and total earliness. Since the problem is NP-hard, there ...