ListarArtículos (Organización Industrial y Gestión de Empresas I) por materia "Scheduling"
Mostrando ítems 1-20 de 34
-
Artículo
A beam-search-based constructive heuristic for the PFSP to minimise total flowtime
(Elsevier, 2017)In this paper we present a beam-search-based constructive heuristic to solve the permutation flowshop scheduling problem ...
-
Artículo
A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem
(Taylor & Francis, 2014)As the interest of practitioners and researchers in scheduling in a multi-factory environment is growing, there is an ...
-
Artículo
A common framework and taxonomy for multicriteria scheduling problems with Interfering and competing Jobs: Multi-agent scheduling problems
(2014)Most classical scheduling research assumes that the objectives sought are common to all jobs to be scheduled. However, ...
-
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 ...
-
Artículo
A new set of high-performing heuristics to minimize flowtime in permutation flowshops
(Elsevier, 2015)This paper addresses the problem of scheduling jobs in a permutation flowshop with the objective of total completion time ...
-
Artículo
A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation
(Elsevier, 2017)The permutation flowshop problem is a classic machine scheduling problem where n jobs must be processed on a set of m ...
-
Artículo
A review and classification of computer-based manufacturing scheduling tools
(Elsevier, 2016)Computer-based manufacturing scheduling tools can play a key role in the management of industrial operations, as obtaining ...
-
Artículo
A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
(Taylor & Francis, 2017)Makespan minimization in permutation flow-shop scheduling is an operations research topic that has been intensively addressed ...
-
Artículo
A speed-up procedure for the hybrid flow shop scheduling problem
(Elsevier Ltd, 2021)During the last decades, hundreds of approximate algorithms have been proposed in the literature addressing flow-shop-based ...
-
Artículo
Assembly flowshop scheduling problem: Speed-up procedure and computational evaluation
(Elsevier, 2022-06)In this paper, we address the assembly flowshop scheduling problem, which is a generalisation of two well-known scheduling ...
-
Artículo
Comparison of heuristics for rescheduling in permutation flowshops
(ADINGOR, 2009)Rescheduling is one of the main consequences of the variability in the shop floor, as a number of unforeseeable disruptions ...
-
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 ...
-
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 ...
-
Artículo
Deterministic Assembly Scheduling Problems: A Review and Classification of Concurrent-Type Scheduling Models and Solution Procedures
(Elsevier, 2019-03)Many activities in industry and services require the scheduling of tasks that can be concurrently executed, the most clear ...
-
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 ...
-
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 ...
-
Artículo
Efficient heuristics for the hybrid flow shop scheduling problem with missing operations
(Elsevier, 2019)In this paper, we address the hybrid flowshop scheduling problem for makespan minimisation. More specifically, we are ...
-
Artículo
Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness
(Elsevier, 2015)This paper focuses on the problem of scheduling jobs in a permutation flowshop with the objective of makespan minimisation ...
-
Artículo
Exploring the benefits of scheduling with advanced and real-time information integration in Industry 4.0: A computational study
(Elsevier, 2022-05)The technological advances recently brought to the manufacturing arena (collectively known as Industry 4.0) offer huge ...
-
Artículo
Guidelines for the deployment and implementation of manufacturing scheduling systems
(Taylor & Francis, 2011)It has frequently been stated that there exists a gap between production scheduling theory and practice. In order to put ...